Spatial search using ray tracing

ABSTRACT

In at least one embodiment, a search of spatial data is performed by reformulating the search problem as a ray tracing problem. In at least one embodiment, the ray tracing problem is solved using a graphics processing unit.

TECHNICAL FIELD

At least one embodiment pertains to processing resources used to performand facilitate spatial search. For example, at least one embodimentpertains to using ray tracing capabilities of graphics processing units(“GPU”) to accelerate processing of a spatial search.

BACKGROUND

Data search operations are an important part of many data processingsystems. One type of data search is spatial search where, in variousexamples, each data point has a number of associated orthogonal values,such as coordinates of a 3-dimensional location. Spatial search is usedin a number of developing areas of technology such as navigation orgeographic searches. In general, as amount of data and size of searchspaces increases, amount of processing power required to complete searchincreases. Therefore, with large geographic datasets, improving speed ofspatial search is an important problem.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 illustrates an example of a 2-dimensional point cloud of data tobe searched, according to at least one embodiment;

FIG. 2 illustrates an example of a set of objects that represent a pointcloud of data to be searched, according to at least one embodiment;

FIG. 3 illustrates an example of a ray that is modeled to solved aspatial search problem, according to at least one embodiment;

FIG. 4 illustrates an example of determining search results based on rayintersections, according to at least one embodiment;

FIG. 5 illustrates an example of a 3-dimensional spatial search,according to at least one embodiment;

FIG. 6 illustrates an example of various types of search regions, andcorresponding region inverses, according to at least one embodiment;

FIG. 7 illustrates a process that, as a result of being performed by acomputer system, performs a spatial search of a point-symmetric space,according to at least one embodiment;

FIG. 8 illustrates a process that, as a result of being performed by acomputer system, performs a spatial search of a non-symmetric space,according to at least one embodiment;

FIG. 9 illustrates a process that, as a result of being performed by acomputer system, performs a plurality of spatial searches, according toat least one embodiment;

FIG. 10A illustrates inference and/or training logic, according to atleast one embodiment;

FIG. 10B illustrates inference and/or training logic, according to atleast one embodiment;

FIG. 11 illustrates training and deployment of a neural network,according to at least one embodiment;

FIG. 12 illustrates an example data center system, according to at leastone embodiment;

FIG. 13A illustrates an example of an autonomous vehicle, according toat least one embodiment;

FIG. 13B illustrates an example of camera locations and fields of viewfor autonomous vehicle of FIG. 13A, according to at least oneembodiment;

FIG. 13C is a block diagram illustrating an example system architecturefor autonomous vehicle of FIG. 13A, according to at least oneembodiment;

FIG. 13D is a diagram illustrating a system for communication betweencloud-based server(s) and autonomous vehicle of FIG. 13A, according toat least one embodiment;

FIG. 14 is a block diagram illustrating a computer system, according toat least one embodiment;

FIG. 15 is a block diagram illustrating computer system, according to atleast one embodiment;

FIG. 16 illustrates a computer system, according to at least oneembodiment;

FIG. 17 illustrates a computer system, according at least oneembodiment;

FIG. 18A illustrates a computer system, according to at least oneembodiment;

FIG. 18B illustrates a computer system, according to at least oneembodiment;

FIG. 18C illustrates a computer system, according to at least oneembodiment;

FIG. 18D illustrates a computer system, according to at least oneembodiment;

FIGS. 18E and 18F illustrate a shared programming model, according to atleast one embodiment;

FIG. 19 illustrates exemplary integrated circuits and associatedgraphics processors, according to at least one embodiment;

FIGS. 20A-20B illustrate exemplary integrated circuits and associatedgraphics processors, according to at least one embodiment;

FIGS. 21A-21B illustrate additional exemplary graphics processor logicaccording to at least one embodiment;

FIG. 22 illustrates a computer system, according to at least oneembodiment;

FIG. 23A illustrates a parallel processor, according to at least oneembodiment;

FIG. 23B illustrates a partition unit, according to at least oneembodiment;

FIG. 23C illustrates a processing cluster, according to at least oneembodiment;

FIG. 23D illustrates a graphics multiprocessor, according to at leastone embodiment;

FIG. 24 illustrates a multi-graphics processing unit (GPU) system,according to at least one embodiment;

FIG. 25 illustrates a graphics processor, according to at least oneembodiment;

FIG. 26 is a block diagram illustrating a processor micro-architecturefor a processor, according to at least one embodiment;

FIG. 27 illustrates a deep learning application processor, according toat least one embodiment;

FIG. 28 is a block diagram illustrating an example neuromorphicprocessor, according to at least one embodiment;

FIG. 29 illustrates at least portions of a graphics processor, accordingto one or more embodiments;

FIG. 30 illustrates at least portions of a graphics processor, accordingto one or more embodiments;

FIG. 31 illustrates at least portions of a graphics processor, accordingto one or more embodiments;

FIG. 32 is a block diagram of a graphics processing engine 3210 of agraphics processor in accordance with at least one embodiment.

FIG. 33 is a block diagram of at least portions of a graphics processorcore, according to at least one embodiment;

FIGS. 34A-34B illustrate thread execution logic 3400 including an arrayof processing elements of a graphics processor core according to atleast one embodiment;

FIG. 35 illustrates a parallel processing unit (“PPU”), according to atleast one embodiment;

FIG. 36 illustrates a general processing cluster (“GPC”), according toat least one embodiment;

FIG. 37 illustrates a memory partition unit of a parallel processingunit (“PPU”), according to at least one embodiment; and

FIG. 38 illustrates a streaming multi-processor, according to at leastone embodiment.

DETAILED DESCRIPTION

In at least one embodiment, a computer system performs a spatial searchby reformulating a set of spatial data points as a set of solid objects.In at least one embodiment, each object in said set of objects is shapedto match an inverse of a search space. In at least one embodiment, a rayis modeled from a point of interest, in an arbitrary direction, to adistance that exceeds an extent of said search space. In at least oneembodiment, a graphical processing unit (“GPU”) with ray-tracing supportis used to model said ray. In at least one embodiment, if, for said ray,a number of exit intersections with an object is greater than a numberof entry intersections with said object, it can be determined that adata point associated with said object is within said search space.

In at least one embodiment, search area is a square, rectangle, circle,sphere, or other point-symmetric shape centered on point of interest,and an object corresponding to shape of said search area is positionedat each data point. In at least one embodiment, search area is anon-point-symmetric shape, and a point-inversion is determined forsearch area. In at least one embodiment, said point-inversion is placedto correspond to each data point.

In at least one embodiment, techniques described herein provide anacceleration structure for fast proximity queries; using a Loose AxisAligned Bounding Box (L-AABB) and a minimum query box granularity of ΔR.In at least one embodiment, a spatial search or neighbor search problemis translated into an area hit problem in ray-tracing. In at least oneembodiment, a common operation for spatial databases is to locate a setof points in vicinity of a reference point. In at least one embodiment,given a database of points in 3D Cartesian space, a system finds set ofpoints within a cube with sides of length R around a given referencepoint.

In at least one embodiment, techniques described herein are efficientwhere many queries are performed on a single database and a minimalsearch range is defined. In at least one embodiment, techniquesdescribed herein are efficient on platforms optimized for ray-geometryintersection queries. In at least one embodiment, spatial accelerationstructures used for ray tracing can help limit number of objects to betested by replacing point data with objects having finite extent. In atleast one embodiment, techniques described herein transform searchproblem on point objects into one for finite sized objects.

In at least one embodiment, rather than searching points within a boxaround reference point, one can instead attach an equally sized box ateach point in database and find all those points whose boxes enclosereference point. In at least one embodiment, boxes enclosing referencepoint are those being hit by a ray emitted from reference point in anarbitrary direction within less than a search distance. In at least oneembodiment, this transformation allows problem to be treated as aray-object intersection problem.

In at least one embodiment, as ray direction can be chosen arbitrarily,one can select a specific direction, e.g., along one of coordinatesystems' axes. In at least one embodiment, without loss of generality, xdirection is designated as preferred direction. In at least oneembodiment, instead of attaching entire search boxes to each point, itis then sufficient to attach search squares in plane perpendicular toray direction. In at least one embodiment, in order to find pointswithin search box, one therefore sends a ray in positive and negativedirection from search point. In at least one embodiment, hits withinless than search distances are therefore within search radius.

In at least one embodiment, for a Query point Q(x,y,z) and a search boxwith length of side R′, where R′=N*ΔR; algorithm can be described asbelow. In at least one embodiment, rays are parallel to X-axis. In atleast one embodiment, a ray can be in any direction.

In at least one embodiment, a database for spatial queries contains aset of points in a 2 or 3 dimensional parameter space. In at least oneembodiment, parameter space is mapped onto coordinate axes of a 3Dscene. In at least one embodiment, each point in database is attached toa Loose Axis Aligned Bounding Box. In at least one embodiment, for agiven position P(x,y,z) of a point in database; length vectorL=(0,ΔR,ΔR) corresponding AABB bounds are defined as:

AABB.min=P−L

AABB.max=P+L

where 2*ΔR is length of side of smallest possible query box. In at leastone embodiment, number of rays needed is 2*N, and Direction Unit vectorof first N rays say “D+” and remaining N “D−” such that:

dot(D+,L)=0

dot(D−,L)=0

D−=−1.0*D+

In at least one embodiment, centers are defined as Ci=Q±ΔC; where ΔC=(0,K, 0). In at least one embodiment, if N is even; K=(1+2*J)*ΔR and T isan integer in range [0, N/2]. In at least one embodiment, if N is odd;K=(2*J)*AR and ‘J’ is an integer in range [0,N/2].

In at least one embodiment, above centers can also be chosen in anynon-null direction of vector L. In at least one embodiment, in abovecase for L=(0, ΔR, ΔR); ΔC=(0, K, 0) or ΔC=(0, 0, K). In at least oneembodiment, basically ΔC vector lies in same plane as L.

In at least one embodiment, rays are then composed with above centersand directions (Ci, D+) and (Ci, D−) and length of ray (t_(max) value)of (R′/2). In at least one embodiment, ray tracing is then performedusing these rays and data structure as discussed previously. In at leastone embodiment, a result of this returns a list of all points, withinsearch box, on which further processing can then be done.

FIG. 1 illustrates an example of a 2-dimensional point cloud of data tobe searched, according to at least one embodiment. In at least oneembodiment, collection of spatial data points is arranged within a spacedefined by and XY axis. In at least one embodiment, search space 102defines a rectangular region. In at least one embodiment, a search queryis submitted to identify those spatial data points present within searchspace 102. In at least one embodiment, search space 102 is symmetricaround a point of interest 116. In at least one embodiment, search space102 may be a circle, square, hexagon, or other point-symmetric shapecentered around point of interest 116. In at least one embodiment, afirst point 104, second point 106, and a third point 108 are withinsearch space 102, and a fourth point 110, fifth point 112, and a sixthpoint 114 are outside search space 102.

FIG. 2 illustrates an example of a set of objects that represent a pointcloud of data to be searched, according to at least one embodiment. Inat least one embodiment, a search query is performed by placing, at eachdata point of interest, an object corresponding to shape of said searchspace. In at least one embodiment, for example, for a square searchspace as illustrated in FIG. 1, a corresponding square object is placedat each spatial data point. In at least one embodiment, a point ofinterest 202 corresponds to a point of interest 116 illustrated inFIG. 1. In at least one embodiment, a first object 204, a second object206, a third object 208, a fourth object 210, and a fifth object 212,correspond to various spatial data points in FIG. 1. In at least oneembodiment, spatial data points or data points can be consideredpotential results to a spatial search query.

FIG. 3 illustrates an example of a ray that is modeled to solve aspatial search problem, according to at least one embodiment. In atleast one embodiment, a set of objects that includes a first object 306,a second object 308, a third object 310, and a fourth object 312, isused to represent a set of possible results (spatial data points). In atleast one embodiment, in response to a spatial query centered around apoint of interest 302, a ray 304 is projected from point of interest302. In at least one embodiment, ray 304 is projected in any directionand projected to a distance that exceeds an extent of a search space. Inat least one embodiment, a set of intersections with said set of objectsis identified. In at least one embodiment, intersections associated witheach object determine whether a respective object is in said searchspace. In at least one embodiment, a set of intersections includes a setof entry intersections and a set of exit intersections for each object.In at least one embodiment, if a number of exit intersections exceeds anumber of entry intersections for a given object, a data pointassociated with said given object can be determined to be within saidsearch space. In at least one embodiment, an object that represents adata point or possible result has a shape that matches said searchspace. In at least one embodiment, an object that represents a datapoint has a shape that is an inverse of said search space centeredaround a point of interest. In at least one embodiment, if a searchspace is symmetric around a point of interest, an object that representsa data point matches a shape of a search space.

FIG. 4 illustrates an example of determining search results based on rayintersections, according to at least one embodiment. In at least oneembodiment, a ray is projected from a point of interest 402 in responseto a search query. In at least one embodiment, FIG. 4 illustrates asubset of objects representing data points shown in FIGS. 1-3. In atleast one embodiment, a first object 404, a second object 406, and athird object 408, are objects where ray produces an exit intersectionwithout a corresponding entry intersection, and therefore it can beconcluded that data points associated with first object 404, secondobject 406, and third object 408, are located within a search spacecentered around point of interest 402. In at least one embodiment, afourth object 410 and a fifth object 412 are objects for which said rayproduces both an entry intersection and an exit intersection. In atleast one embodiment therefore, it can be determined that data pointsassociated with fourth object 410 and fifth object 412 are outside saidsearch space centered around point of interest 402. In at least oneembodiment, any number of potential results or data points can berepresented with a corresponding number of objects. In at least oneembodiment, modeling a single ray produces a set of intersections thatallows a determination as to whether each data point is in or out of anarea of interest.

FIG. 5 illustrates an example of a 3-dimensional spatial search,according to at least one embodiment. In at least one embodiment, eachdata point is a point in three-dimensional space with an X, Y, and Zcoordinate. In at least one embodiment, a region of interest 502centered around a point of interest 516 is in shape of a cube. In atleast one embodiment, other shapes may be used such as a sphere,rectangle, or polygon. In at least one embodiment, a number of spatialdata points including a first data point 504, a second data point 506, athird data point 508 are located within region of interest 502, and afourth data point 510, a fifth data point 512, and a sixth data point514 are located outside region of interest 502. In at least oneembodiment, in order to determine a set of points within region ofinterest 502, a ray is projected from point of interest 516 in order toidentify a set of entry and exit intersections, and based on a number ofentry and exit intersections, individual data points are determined tobe within or outside region of interest 502. In at least one embodiment,techniques described above can be applied to any orthogonal space.

FIG. 6 illustrates an example of various types of search regions, andcorresponding region inverses, according to at least one embodiment. Inat least one embodiment, a search region can be a point-symmetric shapesuch as a circle 602. In at least one embodiment, a point-symmetricsearch region can include voids such as those present in a donut-shapedsearch region 604. In at least one embodiment, when a search region ispoint-symmetric around a point of interest, objects representingindividual data points match shape of said search region.

In at least one embodiment, nonpoint-symmetric search regions areusable. In at least one embodiment, when a nonpoint-symmetric searchregion is used, objects placed to represent data points have a shapethat is an inverse of said search region. In at least one embodiment, asearch region having a right facing Chevron shape 606 is inverted arounda point of interest to produce a left facing Chevron shape 608, andindividual data points are replaced with left facing Chevron shape 608to perform a spatial search via ray tracing. In at least one embodiment,a search region having a polygon shape 610 can be inverted to produce aninverted polygon shape 612. In at least one embodiment, individual datapoints to be searched are replaced with inverted polygon shape 612 toperform a spatial search via ray tracing. In at least one embodiment, anarbitrary shaped search region can be inverted around a point ofinterest to create proxy objects that are used to represent individualdata points. In at least one embodiment, intersections between a rayprojected from said point of interest are used to determine if a pointassociated with a proxy object is within a search area corresponding toa non-inverted shape.

FIG. 7 illustrates a process 700 that, as a result of being performed bya computer system, performs a spatial search of a point-symmetric space,according to at least one embodiment. In at least one embodiment,process 700 begins at block 702, with system obtaining a set of spatialdata points, a point of interest, and a point-symmetric search regionfrom a requester. In at least one embodiment, spatial data points arepotential search results. In at least one embodiment, a requestersubmits a spatial query that seeks to determine a subset of spatial datapoints that are within a point-symmetric search space.

In at least one embodiment, at block 704, a computer system generates anobject matching shape of said point-symmetric search space for eachspatial data point. In at least one embodiment, generated objects areplaced such that a point of symmetry of said point-symmetric object islocated at each individual data point. In at least one embodiment, atblock 706, a ray is traced from said point of interest in an arbitrarydirection to an extent that exceeds extent of search space in directionof said ray. In at least one embodiment, a direction for a ray is chosenbased on geometry of search space by, for example, directing ray in adirection where said search space has a lower extent. In at least oneembodiment, at block 708, tracing a ray produces a set of intersectionswith said generated objects. In at least one embodiment, a set ofintersections for an object includes entry intersections and exitintersections.

In at least one embodiment, ray tracing can be performed by ray-tracingacceleration hardware in a GPU. In at least one embodiment, tracing theray is performed using software-based ray-tracing acceleration. In atleast one embodiment, ray-tracing algorithms scale logarithmically dueat least in part to object models being stored in tree structures orsimilar data structures.

In at least one embodiment, at block 710, if a number of exitintersections exceeds a number of entry intersections for a givenobject, said given object can be determined to enclose point ofinterest. In at least one embodiment, as a result, it follows that aspatial data point associated with said given object is within saidsearch area. In at least one embodiment, at block 712, intersectionsassociated with each objects are processed, and using this information,a set of objects that are within said search region. In at least oneembodiment, a computer system first identifies a subset of objects thathave at least one intersection with said ray, and then analyzes eachobject in said subset to determine if there are more exit intersectionsthan entry intersections.

FIG. 8 illustrates a process that, as a result of being performed by acomputer system, performs a spatial search of a non-symmetric space,according to at least one embodiment. In at least one embodiment,process 800 begins at block 802, with system obtaining a set of spatialdata points, a point of interest, and a search region from a requester.In at least one embodiment, spatial data points are potential searchresults. In at least one embodiment, a requester submits a spatial querythat seeks to determine a subset of spatial data points that are withina search space.

In at least one embodiment, at block 804, a computer system generates atemplate object that is an inversion of search space around said pointof interest. In at least one embodiment, a search space is inverted withrespect to a point as illustrated in FIG. 6 to produce template object.In at least one embodiment, at block 806, a computer system generates anobject matching a shape of said template object for each spatial datapoint. In at least one embodiment, generated objects are placed suchthat a point of symmetry of said template object is located at eachindividual data point. In at least one embodiment, at block 808, a rayis traced from said point of interest in an arbitrary direction to anextent that exceeds extent of inverted search space in direction of saidray. In at least one embodiment, a direction for a ray is chosen basedon geometry of a search space by, for example, directing said ray in adirection where said search space has a lower extent. In at least oneembodiment, at block 810, tracing a ray produces a set of intersectionswith said generated objects. In at least one embodiment, a set ofintersections for an object includes entry intersections and exitintersections.

In at least one embodiment, at block 812, if a number of exitintersections exceeds a number of entry intersections for a givenobject, said given object can be determined to enclose point ofinterest. In at least one embodiment, as a result, it follows that aspatial data point associated with said given object is within saidsearch area. In at least one embodiment, at block 814, intersectionsassociated with each object are processed, and using this information, aset of objects that are within said search region. In at least oneembodiment, a computer system first identifies a subset of objects thathave at least one intersection with said ray, and then analyzes eachobject in said subset to determine if there are more exit intersectionsthan entry intersections.

FIG. 9 illustrates a process that, as a result of being performed by acomputer system, performs a plurality of spatial searches, according toat least one embodiment. In at least one embodiment, process 900 beginsat block 902, with system obtaining a set of spatial data points, apoint of interest, and a plurality of search regions from a requester.In at least one embodiment, spatial data points are potential searchresults. In at least one embodiment, a requester submits a spatial querythat seeks to determine a subset of spatial data points that are withina plurality of search regions. In at least one embodiment, plurality ofsearch regions are a combination of regions that produce a desiredregion.

In at least one embodiment, at block 904, a computer system generates atemplate object for each search space that is an inversion of arespective search space around a corresponding point of interest. In atleast one embodiment, a search space is inverted with respect to a pointas illustrated in FIG. 6 to produce template object. In at least oneembodiment, at block 906, a computer system generates an object matchinga shape of each template object for each spatial data point. In at leastone embodiment, generated objects are placed such that a point ofsymmetry of said template object is located at each individual datapoint. In at least one embodiment, at block 908, a ray is traced fromsaid point of interest in an arbitrary direction to an extent thatexceeds a largest extent of inverted search spaces in direction of saidray. In at least one embodiment, a direction for a ray is chosen basedon geometry of search space by, for example, directing ray in adirection where said (inverted) search space has a lower extent. In atleast one embodiment, at block 910, tracing a ray produces a set ofintersections with said generated objects. In at least one embodiment, aset of intersections for an object includes entry intersections and exitintersections.

In at least one embodiment, at block 912, if a number of exitintersections exceeds a number of entry intersections for a givenobject, a given object can be determined to enclose a point of interest.In at least one embodiment, as a result, it follows that a spatial datapoint associated with said given object is within said search area. Inat least one embodiment, at block 914, intersections associated witheach object are processed, and using this information, a set of objectsthat are within said search region are identified. In at least oneembodiment, a computer system first identifies a subset of objects thathave at least one intersection with said ray, and then analyzes eachobject in said subset to determine if there are more exit intersectionsthan entry intersections. In at least one embodiment, system groupsintersections on a per object basis, and identifies which search spacesa data point is within based on intersections associated with eachobject.

In at least one embodiment, techniques described herein can be appliedto navigational problems such as searching a spatial database forwaypoints, points of interest, or nearby businesses. In at least oneembodiment, techniques described herein may be used to search parameterspaces in a machine learning system. In at least one embodiment, aspatial database is a data store of data elements, such as spatial datapoints, where each data element is associated with a number oforthogonal values. In at least one embodiment, spatial search techniquesmay be applied to navigation problems. In at least one embodiment,points of interest around a vehicle are determined by defining a searchspace around said vehicle and locating points of interest in relation tothe vehicle using the above techniques.

In at least one embodiment, spatial search techniques such as thosedescribed above may be implemented using a computer system such as theone illustrated in FIG. 14 and described in the associated description.In at least one embodiment, ray tracing is performed using ray-tracinghardware in a graphics processing unit such as that shown in FIG. 18A-F.

Inference and Training Logic

FIG. 10A illustrates inference and/or training logic 1015 used toperform inferencing and/or training operations associated with one ormore embodiments. Details regarding inference and/or training logic 1015are provided below in conjunction with FIGS. 10A and/or 10B.

In at least one embodiment, inference and/or training logic 1015 mayinclude, without limitation, code and/or data storage 1001 to storeforward and/or output weight and/or input/output data, and/or otherparameters to configure neurons or layers of a neural network trainedand/or used for inferencing in aspects of one or more embodiments. In atleast one embodiment, training logic 1015 may include, or be coupled tocode and/or data storage 1001 to store graph code or other software tocontrol timing and/or order, in which weight and/or other parameterinformation is to be loaded to configure, logic, including integerand/or floating point units (collectively, arithmetic logic units(ALUs)). In at least one embodiment, code, such as graph code, loadsweight or other parameter information into processor ALUs based on anarchitecture of a neural network to which the code corresponds. In atleast one embodiment code and/or data storage 1001 stores weightparameters and/or input/output data of each layer of a neural networktrained or used in conjunction with one or more embodiments duringforward propagation of input/output data and/or weight parameters duringtraining and/or inferencing using aspects of one or more embodiments. Inat least one embodiment, any portion of code and/or data storage 1001may be included with other on-chip or off-chip data storage, including aprocessor's L1, L2, or L3 cache or system memory.

In at least one embodiment, any portion of code and/or data storage 1001may be internal or external to one or more processors or other hardwarelogic devices or circuits. In at least one embodiment, code and/or codeand/or data storage 1001 may be cache memory, dynamic randomlyaddressable memory (“DRAM”), static randomly addressable memory(“SRAM”), non-volatile memory (e.g., Flash memory), or other storage. Inat least one embodiment, choice of whether code and/or code and/or datastorage 1001 is internal or external to a processor, for example, orcomprised of DRAM, SRAM, Flash or some other storage type may depend onavailable storage on-chip versus off-chip, latency requirements oftraining and/or inferencing functions being performed, batch size ofdata used in inferencing and/or training of a neural network, or somecombination of these factors.

In at least one embodiment, inference and/or training logic 1015 mayinclude, without limitation, a code and/or data storage 1005 to storebackward and/or output weight and/or input/output data corresponding toneurons or layers of a neural network trained and/or used forinferencing in aspects of one or more embodiments. In at least oneembodiment, code and/or data storage 1005 stores weight parametersand/or input/output data of each layer of a neural network trained orused in conjunction with one or more embodiments during backwardpropagation of input/output data and/or weight parameters duringtraining and/or inferencing using aspects of one or more embodiments. Inat least one embodiment, training logic 1015 may include, or be coupledto code and/or data storage 1005 to store graph code or other softwareto control timing and/or order, in which weight and/or other parameterinformation is to be loaded to configure, logic, including integerand/or floating point units (collectively, arithmetic logic units(ALUs)). In at least one embodiment, code, such as graph code, loadsweight or other parameter information into processor ALUs based on anarchitecture of a neural network to which code corresponds. In at leastone embodiment, any portion of code and/or data storage 1005 may beincluded with other on-chip or off-chip data storage, including aprocessor's L1, L2, or L3 cache or system memory. In at least oneembodiment, any portion of code and/or data storage 1005 may be internalor external to on one or more processors or other hardware logic devicesor circuits. In at least one embodiment, code and/or data storage 1005may be cache memory, DRAM, SRAM, non-volatile memory (e.g., Flashmemory), or other storage. In at least one embodiment, choice of whethercode and/or data storage 1005 is internal or external to a processor,for example, or comprised of DRAM, SRAM, Flash or some other storagetype may depend on available storage on-chip versus off-chip, latencyrequirements of training and/or inferencing functions being performed,batch size of data used in inferencing and/or training of a neuralnetwork, or some combination of these factors.

In at least one embodiment, code and/or data storage 1001 and codeand/or data storage 1005 may be separate storage structures. In at leastone embodiment, code and/or data storage 1001 and code and/or datastorage 1005 may be same storage structure. In at least one embodiment,code and/or data storage 1001 and code and/or data storage 1005 may bepartially same storage structure and partially separate storagestructures. In at least one embodiment, any portion of code and/or datastorage 1001 and code and/or data storage 1005 may be included withother on-chip or off-chip data storage, including a processor's L1, L2,or L3 cache or system memory.

In at least one embodiment, inference and/or training logic 1015 mayinclude, without limitation, one or more arithmetic logic unit(s)(“ALU(s)”) 1010, including integer and/or floating point units, toperform logical and/or mathematical operations based, at least in parton, or indicated by, training and/or inference code (e.g., graph code),a result of which may produce activations (e.g., output values fromlayers or neurons within a neural network) stored in an activationstorage 1020 that are functions of input/output and/or weight parameterdata stored in code and/or data storage 1001 and/or code and/or datastorage 1005. In at least one embodiment, activations stored inactivation storage 1020 are generated according to linear algebraic andor matrix-based mathematics performed by ALU(s) 1010 in response toperforming instructions or other code, wherein weight values stored incode and/or data storage 1005 and/or data 1001 are used as operandsalong with other values, such as bias values, gradient information,momentum values, or other parameters or hyperparameters, any or all ofwhich may be stored in code and/or data storage 1005 or code and/or datastorage 1001 or another storage on or off-chip.

In at least one embodiment, ALU(s) 1010 are included within one or moreprocessors or other hardware logic devices or circuits, whereas inanother embodiment, ALU(s) 1010 may be external to a processor or otherhardware logic device or circuit that uses them (e.g., a co-processor).In at least one embodiment, ALUs 1010 may be included within aprocessor's execution units or otherwise within a bank of ALUsaccessible by a processor's execution units either within same processoror distributed between different processors of different types (e.g.,central processing units, graphics processing units, fixed functionunits, etc.). In at least one embodiment, data storage 1001, code and/ordata storage 1005, and activation storage 1020 may be on same processoror other hardware logic device or circuit, whereas in anotherembodiment, they may be in different processors or other hardware logicdevices or circuits, or some combination of same and differentprocessors or other hardware logic devices or circuits. In at least oneembodiment, any portion of activation storage 1020 may be included withother on-chip or off-chip data storage, including a processor's L1, L2,or L3 cache or system memory. Furthermore, inferencing and/or trainingcode may be stored with other code accessible to a processor or otherhardware logic or circuit and fetched and/or processed using aprocessor's fetch, decode, scheduling, execution, retirement and/orother logical circuits.

In at least one embodiment, activation storage 1020 may be cache memory,DRAM, SRAM, non-volatile memory (e.g., Flash memory), or other storage.In at least one embodiment, activation storage 1020 may be completely orpartially within or external to one or more processors or other logicalcircuits. In at least one embodiment, choice of whether activationstorage 1020 is internal or external to a processor, for example, orcomprised of DRAM, SRAM, Flash or some other storage type may depend onavailable storage on-chip versus off-chip, latency requirements oftraining and/or inferencing functions being performed, batch size ofdata used in inferencing and/or training of a neural network, or somecombination of these factors. In at least one embodiment, inferenceand/or training logic 1015 illustrated in FIG. 10A may be used inconjunction with an application-specific integrated circuit (“ASIC”),such as Tensorflow® Processing Unit from Google, an inference processingunit (IPU) from Graphcore™, or a Nervana® (e.g., “Lake Crest”) processorfrom Intel Corp. In at least one embodiment, inference and/or traininglogic 1015 illustrated in FIG. 10A may be used in conjunction withcentral processing unit (“CPU”) hardware, graphics processing unit(“GPU”) hardware or other hardware, such as field programmable gatearrays (“FPGAs”).

FIG. 10B illustrates inference and/or training logic 1015, according toat least one embodiment various. In at least one embodiment, inferenceand/or training logic 1015 may include, without limitation, hardwarelogic in which computational resources are dedicated or otherwiseexclusively used in conjunction with weight values or other informationcorresponding to one or more layers of neurons within a neural network.In at least one embodiment, inference and/or training logic 1015illustrated in FIG. 10B may be used in conjunction with anapplication-specific integrated circuit (ASIC), such as Tensorflow®Processing Unit from Google, an inference processing unit (IPU) fromGraphcore™, or a Nervana® (e.g., “Lake Crest”) processor from IntelCorp. In at least one embodiment, inference and/or training logic 1015illustrated in FIG. 10B may be used in conjunction with centralprocessing unit (CPU) hardware, graphics processing unit (GPU) hardwareor other hardware, such as field programmable gate arrays (FPGAs). In atleast one embodiment, inference and/or training logic 1015 includes,without limitation, code and/or data storage 1001 and code and/or datastorage 1005, which may be used to store code (e.g., graph code), weightvalues and/or other information, including bias values, gradientinformation, momentum values, and/or other parameter or hyperparameterinformation. In at least one embodiment illustrated in FIG. 10B, each ofcode and/or data storage 1001 and code and/or data storage 1005 isassociated with a dedicated computational resource, such ascomputational hardware 1002 and computational hardware 1006,respectively. In at least one embodiment, each of computational hardware1002 and computational hardware 1006 comprises one or more ALUs thatperform mathematical functions, such as linear algebraic functions, onlyon information stored in code and/or data storage 1001 and code and/ordata storage 1005, respectively, result of which is stored in activationstorage 1020.

In at least one embodiment, each of code and/or data storage 1001 and1005 and corresponding computational hardware 1002 and 1006,respectively, correspond to different layers of a neural network, suchthat resulting activation from one “storage/computational pair1001/1002” of code and/or data storage 1001 and computational hardware1002 is provided as an input to next “storage/computational pair1005/1006” of code and/or data storage 1005 and computational hardware1006, in order to mirror conceptual organization of a neural network. Inat least one embodiment, each of storage/computational pairs 1001/1002and 1005/1006 may correspond to more than one neural network layer. Inat least one embodiment, additional storage/computation pairs (notshown) subsequent to or in parallel with storage computation pairs1001/1002 and 1005/1006 may be included in inference and/or traininglogic 1015.

Neural Network Training and Deployment

FIG. 11 illustrates training and deployment of a deep neural network,according to at least one embodiment. In at least one embodiment,untrained neural network 91106 is trained using a training dataset 1102.In at least one embodiment, training framework 1104 is a PyTorchframework, whereas in other embodiments, training framework 1104 is aTensorflow, Boost, Caffe, Microsoft Cognitive Toolkit/CNTK, MXNet,Chainer, Keras, Deeplearning4j, or other training framework. In at leastone embodiment training framework 1104 trains an untrained neuralnetwork 1106 and enables it to be trained using processing resourcesdescribed herein to generate a trained neural network 1108. In at leastone embodiment, weights may be chosen randomly or by pre-training usinga deep belief network. In at least one embodiment, training may beperformed in either a supervised, partially supervised, or unsupervisedmanner.

In at least one embodiment, untrained neural network 1106 is trainedusing supervised learning, wherein training dataset 1102 includes aninput paired with a desired output for an input, or where trainingdataset 1102 includes input having a known output and an output ofneural network 1106 is manually graded. In at least one embodiment,untrained neural network 1106 is trained in a supervised mannerprocesses inputs from training dataset 1102 and compares resultingoutputs against a set of expected or desired outputs. In at least oneembodiment, errors are then propagated back through untrained neuralnetwork 1106. In at least one embodiment, training framework 1104adjusts weights that control untrained neural network 1106. In at leastone embodiment, training framework 1104 includes tools to monitor howwell untrained neural network 1106 is converging towards a model, suchas trained neural network 1108, suitable to generating correct answers,such as in result 1114, based on known input data, such as new data1112. In at least one embodiment, training framework 1104 trainsuntrained neural network 1106 repeatedly while adjust weights to refinean output of untrained neural network 1106 using a loss function andadjustment algorithm, such as stochastic gradient descent. In at leastone embodiment, training framework 1104 trains untrained neural network1106 until untrained neural network 1106 achieves a desired accuracy. Inat least one embodiment, trained neural network 1108 can then bedeployed to implement any number of machine learning operations.

In at least one embodiment, untrained neural network 1106 is trainedusing unsupervised learning, wherein untrained neural network 1106attempts to train itself using unlabeled data. In at least oneembodiment, unsupervised learning training dataset 1102 will includeinput data without any associated output data or “ground truth” data. Inat least one embodiment, untrained neural network 1106 can learngroupings within training dataset 1102 and can determine how individualinputs are related to untrained dataset 1102. In at least oneembodiment, unsupervised training can be used to generate aself-organizing map, which is a type of trained neural network 1108capable of performing operations useful in reducing dimensionality ofnew data 1112. In at least one embodiment, unsupervised training canalso be used to perform anomaly detection, which allows identificationof data points in a new dataset 1112 that deviate from normal patternsof new dataset 1112.

In at least one embodiment, semi-supervised learning may be used, whichis a technique in which in training dataset 1102 includes a mix oflabeled and unlabeled data. In at least one embodiment, trainingframework 1104 may be used to perform incremental learning, such asthrough transferred learning techniques. In at least one embodiment,incremental learning enables trained neural network 1108 to adapt to newdata 1112 without forgetting knowledge instilled within network duringinitial training.

Data Center

FIG. 12 illustrates an example data center 1200, in which at least oneembodiment may be used. In at least one embodiment, data center 1200includes a data center infrastructure layer 1210, a framework layer1220, a software layer 1230 and an application layer 1240.

In at least one embodiment, as shown in FIG. 12, data centerinfrastructure layer 1210 may include a resource orchestrator 1212,grouped computing resources 1214, and node computing resources (“nodeC.R.s”) 1216(1)-1216(N), where “N” represents any whole, positiveinteger. In at least one embodiment, node C.R.s 1216(1)-1216(N) mayinclude, but are not limited to, any number of central processing units(“CPUs”) or other processors (including accelerators, field programmablegate arrays (FPGAs), graphics processors, etc.), memory devices (e.g.,dynamic read-only memory), storage devices (e.g., solid state or diskdrives), network input/output (“NW I/O”) devices, network switches,virtual machines (“VMs”), power modules, and cooling modules, etc. In atleast one embodiment, one or more node C.R.s from among node C.R.s1216(1)-1216(N) may be a server having one or more of above-mentionedcomputing resources.

In at least one embodiment, grouped computing resources 1214 may includeseparate groupings of node C.R.s housed within one or more racks (notshown), or many racks housed in data centers at various geographicallocations (also not shown). Separate groupings of node C.R.s withingrouped computing resources 1214 may include grouped compute, network,memory or storage resources that may be configured or allocated tosupport one or more workloads. In at least one embodiment, several nodeC.R.s including CPUs or processors may grouped within one or more racksto provide compute resources to support one or more workloads. In atleast one embodiment, one or more racks may also include any number ofpower modules, cooling modules, and network switches, in anycombination.

In at least one embodiment, resource orchestrator 1212 may configure orotherwise control one or more node C.R.s 1216(1)-1216(N) and/or groupedcomputing resources 1214. In at least one embodiment, resourceorchestrator 1212 may include a software design infrastructure (“SDI”)management entity for data center 1200. In at least one embodiment,resource orchestrator may include hardware, software or some combinationthereof.

In at least one embodiment, as shown in FIG. 12, framework layer 1220includes a job scheduler 1232, a configuration manager 1234, a resourcemanager 1236 and a distributed file system 1238. In at least oneembodiment, framework layer 1220 may include a framework to supportsoftware 1232 of software layer 1230 and/or one or more application(s)1242 of application layer 1240. In at least one embodiment, software1232 or application(s) 1242 may respectively include web-based servicesoftware or applications, such as those provided by Amazon Web Services,Google Cloud and Microsoft Azure. In at least one embodiment, frameworklayer 1220 may be, but is not limited to, a type of free and open-sourcesoftware web application framework such as Apache Spark™ (hereinafter“Spark”) that may utilize distributed file system 1238 for large-scaledata processing (e.g., “big data”). In at least one embodiment, jobscheduler 1232 may include a Spark driver to facilitate scheduling ofworkloads supported by various layers of data center 1200. In at leastone embodiment, configuration manager 1234 may be capable of configuringdifferent layers such as software layer 1230 and framework layer 1220including Spark and distributed file system 1238 for supportinglarge-scale data processing. In at least one embodiment, resourcemanager 1236 may be capable of managing clustered or grouped computingresources mapped to or allocated for support of distributed file system1238 and job scheduler 1232. In at least one embodiment, clustered orgrouped computing resources may include grouped computing resource 1214at data center infrastructure layer 1210. In at least one embodiment,resource manager 1236 may coordinate with resource orchestrator 1212 tomanage these mapped or allocated computing resources.

In at least one embodiment, software 1232 included in software layer1230 may include software used by at least portions of node C.R.s1216(1)-1216(N), grouped computing resources 1214, and/or distributedfile system 1238 of framework layer 1220. One or more types of softwaremay include, but are not limited to, Internet web page search software,e-mail virus scan software, database software, and streaming videocontent software.

In at least one embodiment, application(s) 1242 included in applicationlayer 1240 may include one or more types of applications used by atleast portions of node C.R.s 1216(1)-1216(N), grouped computingresources 1214, and/or distributed file system 1238 of framework layer1220. One or more types of applications may include, but are not limitedto, any number of a genomics application, a cognitive compute, and amachine learning application, including training or inferencingsoftware, machine learning framework software (e.g., PyTorch,TensorFlow, Caffe, etc.) or other machine learning applications used inconjunction with one or more embodiments.

In at least one embodiment, any of configuration manager 1234, resourcemanager 1236, and resource orchestrator 1212 may implement any numberand type of self-modifying actions based on any amount and type of dataacquired in any technically feasible fashion. In at least oneembodiment, self-modifying actions may relieve a data center operator ofdata center 1200 from making possibly bad configuration decisions andpossibly avoiding underutilized and/or poor performing portions of adata center.

In at least one embodiment, data center 1200 may include tools,services, software or other resources to train one or more machinelearning models or predict or infer information using one or moremachine learning models according to one or more embodiments describedherein. For example, in at least one embodiment, a machine learningmodel may be trained by calculating weight parameters according to aneural network architecture using software and computing resourcesdescribed above with respect to data center 1200. In at least oneembodiment, trained machine learning models corresponding to one or moreneural networks may be used to infer or predict information usingresources described above with respect to data center 1200 by usingweight parameters calculated through one or more training techniquesdescribed herein.

In at least one embodiment, data center may use CPUs,application-specific integrated circuits (ASICs), GPUs, FPGAs, or otherhardware to perform training and/or inferencing using above-describedresources. Moreover, one or more software and/or hardware resourcesdescribed above may be configured as a service to allow users to trainor performing inferencing of information, such as image recognition,speech recognition, or other artificial intelligence services.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 12 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

Autonomous Vehicle

FIG. 13A illustrates an example of an autonomous vehicle 1300, accordingto at least one embodiment. In at least one embodiment, autonomousvehicle 1300 (alternatively referred to herein as “vehicle 1300”) maybe, without limitation, a passenger vehicle, such as a car, a truck, abus, and/or another type of vehicle that accommodates one or morepassengers. In at least one embodiment, vehicle 1300 may be asemi-tractor-trailer truck used for hauling cargo. In at least oneembodiment, vehicle 1300 may be an airplane, robotic vehicle, or otherkind of vehicle.

Autonomous vehicles may be described in terms of automation levels,defined by National Highway Traffic Safety Administration (“NHTSA”), adivision of US Department of Transportation, and Society of AutomotiveEngineers (“SAE”) “Taxonomy and Definitions for Terms Related to DrivingAutomation Systems for On-Road Motor Vehicles” (e.g., Standard No.J3016-201806, published on Jun. 15, 2018, Standard No. J3016-201609,published on Sep. 30, 2016, and previous and future versions of thisstandard). In one or more embodiments, vehicle 1300 may be capable offunctionality in accordance with one or more of level 1-level 5 ofautonomous driving levels. For example, in at least one embodiment,vehicle 1300 may be capable of conditional automation (Level 3), highautomation (Level 4), and/or full automation (Level 5), depending onembodiment.

In at least one embodiment, vehicle 1300 may include, withoutlimitation, components such as a chassis, a vehicle body, wheels (e.g.,2, 4, 6, 8, 18, etc.), tires, axles, and other components of a vehicle.In at least one embodiment, vehicle 1300 may include, withoutlimitation, a propulsion system 1350, such as an internal combustionengine, hybrid electric power plant, an all-electric engine, and/oranother propulsion system type. In at least one embodiment, propulsionsystem 1350 may be connected to a drive train of vehicle 1300, which mayinclude, without limitation, a transmission, to enable propulsion ofvehicle 1300. In at least one embodiment, propulsion system 1350 may becontrolled in response to receiving signals from athrottle/accelerator(s) 1352.

In at least one embodiment, a steering system 1354, which may include,without limitation, a steering wheel, is used to steer a vehicle 1300(e.g., along a desired path or route) when a propulsion system 1350 isoperating (e.g., when vehicle is in motion). In at least one embodiment,a steering system 1354 may receive signals from steering actuator(s)1356. Steering wheel may be optional for full automation (Level 5)functionality. In at least one embodiment, a brake sensor system 1346may be used to operate vehicle brakes in response to receiving signalsfrom brake actuator(s) 1348 and/or brake sensors.

In at least one embodiment, controller(s) 1336, which may include,without limitation, one or more system on chips (“SoCs”) (not shown inFIG. 13A) and/or graphics processing unit(s) (“GPU(s)”), provide signals(e.g., representative of commands) to one or more components and/orsystems of vehicle 1300. For instance, in at least one embodiment,controller(s) 1336 may send signals to operate vehicle brakes via brakeactuators 1348, to operate steering system 1354 via steering actuator(s)1356, to operate propulsion system 1350 via throttle/accelerator(s)1352. Controller(s) 1336 may include one or more onboard (e.g.,integrated) computing devices (e.g., supercomputers) that process sensorsignals, and output operation commands (e.g., signals representingcommands) to enable autonomous driving and/or to assist a human driverin driving vehicle 1300. In at least one embodiment, controller(s) 1336may include a first controller 1336 for autonomous driving functions, asecond controller 1336 for functional safety functions, a thirdcontroller 1336 for artificial intelligence functionality (e.g.,computer vision), a fourth controller 1336 for infotainmentfunctionality, a fifth controller 1336 for redundancy in emergencyconditions, and/or other controllers. In at least one embodiment, asingle controller 1336 may handle two or more of above functionalities,two or more controllers 1336 may handle a single functionality, and/orany combination thereof.

In at least one embodiment, controller(s) 1336 provide signals forcontrolling one or more components and/or systems of vehicle 1300 inresponse to sensor data received from one or more sensors (e.g., sensorinputs). In at least one embodiment, sensor data may be received from,for example and without limitation, global navigation satellite systems(“GNSS”) sensor(s) 1358 (e.g., Global Positioning System sensor(s)),RADAR sensor(s) 1360, ultrasonic sensor(s) 1362, LIDAR sensor(s) 1364,inertial measurement unit (“IMU”) sensor(s) 1366 (e.g.,accelerometer(s), gyroscope(s), magnetic compass(es), magnetometer(s),etc.), microphone(s) 1396, stereo camera(s) 1368, wide-view camera(s)1370 (e.g., fisheye cameras), infrared camera(s) 1372, surroundcamera(s) 1374 (e.g., 360 degree cameras), long-range cameras (not shownin FIG. 13A), mid-range camera(s) (not shown in FIG. 13A), speedsensor(s) 1344 (e.g., for measuring speed of vehicle 1300), vibrationsensor(s) 1342, steering sensor(s) 1340, brake sensor(s) (e.g., as partof brake sensor system 1346), and/or other sensor types.

In at least one embodiment, one or more of controller(s) 1336 mayreceive inputs (e.g., represented by input data) from an instrumentcluster 1332 of vehicle 1300 and provide outputs (e.g., represented byoutput data, display data, etc.) via a human-machine interface (“HMI”)display 1334, an audible annunciator, a loudspeaker, and/or via othercomponents of vehicle 1300. In at least one embodiment, outputs mayinclude information such as vehicle velocity, speed, time, map data(e.g., a High Definition map) (not shown in FIG. 13A), location data(e.g., vehicle's 1300 location, such as on a map), direction, locationof other vehicles (e.g., an occupancy grid), information about objectsand status of objects as perceived by controller(s) 1336, etc. Forexample, in at least one embodiment, HMI display 1334 may displayinformation about presence of one or more objects (e.g., a street sign,caution sign, traffic light changing, etc.), and/or information aboutdriving maneuvers vehicle has made, is making, or will make (e.g.,changing lanes now, taking exit 34B in two miles, etc.).

In at least one embodiment, vehicle 1300 further includes a networkinterface 1324 which may use wireless antenna(s) 1326 and/or modem(s) tocommunicate over one or more networks. For example, in at least oneembodiment, network interface 1324 may be capable of communication overLong-Term Evolution (“LTE”), Wideband Code Division Multiple Access(“WCDMA”), Universal Mobile Telecommunications System (“UMTS”), GlobalSystem for Mobile communication (“GSM”), IMT-CDMA Multi-Carrier(“CDMA2000”), etc. In at least one embodiment, wireless antenna(s) 1326may also enable communication between objects in environment (e.g.,vehicles, mobile devices, etc.), using local area network(s), such asBluetooth, Bluetooth Low Energy (“LE”), Z-Wave, ZigBee, etc., and/or lowpower wide-area network(s) (“LPWANs”), such as LoRaWAN, SigFox, etc.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 13A for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 13B illustrates an example of camera locations and fields of viewfor autonomous vehicle 1300 of FIG. 13A, according to at least oneembodiment. In at least one embodiment, cameras and respective fields ofview are one example embodiment and are not intended to be limiting. Forinstance, in at least one embodiment, additional and/or alternativecameras may be included and/or cameras may be located at differentlocations on vehicle 1300.

In at least one embodiment, camera types for cameras may include, butare not limited to, digital cameras that may be adapted for use withcomponents and/or systems of vehicle 1300. Camera(s) may operate atautomotive safety integrity level (“ASIL”) B and/or at another ASIL. Inat least one embodiment, camera types may be capable of any imagecapture rate, such as 60 frames per second (fps), 1220 fps, 240 fps,etc., depending on embodiment. In at least one embodiment, cameras maybe capable of using rolling shutters, global shutters, another type ofshutter, or a combination thereof. In at least one embodiment, colorfilter array may include a red clear clear clear (“RCCC”) color filterarray, a red clear clear blue (“RCCB”) color filter array, a red bluegreen clear (“RBGC”) color filter array, a Foveon X3 color filter array,a Bayer sensors (“RGGB”) color filter array, a monochrome sensor colorfilter array, and/or another type of color filter array. In at least oneembodiment, clear pixel cameras, such as cameras with an RCCC, an RCCB,and/or an RBGC color filter array, may be used in an effort to increaselight sensitivity.

In at least one embodiment, one or more of camera(s) may be used toperform advanced driver assistance systems (“ADAS”) functions (e.g., aspart of a redundant or fail-safe design). For example, in at least oneembodiment, a Multi-Function Mono Camera may be installed to providefunctions including lane departure warning, traffic sign assist andintelligent headlamp control. In at least one embodiment, one or more ofcamera(s) (e.g., all of cameras) may record and provide image data(e.g., video) simultaneously.

In at least one embodiment, one or more of cameras may be mounted in amounting assembly, such as a custom designed (three-dimensional (“3D”)printed) assembly, in order to cut out stray light and reflections fromwithin car (e.g., reflections from dashboard reflected in windshieldmirrors) which may interfere with camera's image data capture abilities.With reference to wing-mirror mounting assemblies, in at least oneembodiment, wing-mirror assemblies may be custom 3D printed so thatcamera mounting plate matches shape of wing-mirror. In at least oneembodiment, camera(s) may be integrated into wing-mirror. For side-viewcameras, camera(s) may also be integrated within four pillars at eachcorner of cabin at least one embodiment.

In at least one embodiment, cameras with a field of view that includeportions of environment in front of vehicle 1300 (e.g., front-facingcameras) may be used for surround view, to help identify forward facingpaths and obstacles, as well as aid in, with help of one or more ofcontrollers 1336 and/or control SoCs, providing information critical togenerating an occupancy grid and/or determining preferred vehicle paths.In at least one embodiment, front-facing cameras may be used to performmany of same ADAS functions as LIDAR, including, without limitation,emergency braking, pedestrian detection, and collision avoidance. In atleast one embodiment, front-facing cameras may also be used for ADASfunctions and systems including, without limitation, Lane DepartureWarnings (“LDW”), Autonomous Cruise Control (“ACC”), and/or otherfunctions such as traffic sign recognition.

In at least one embodiment, a variety of cameras may be used in afront-facing configuration, including, for example, a monocular cameraplatform that includes a CMOS (“complementary metal oxidesemiconductor”) color imager. In at least one embodiment, wide-viewcamera 1370 may be used to perceive objects coming into view fromperiphery (e.g., pedestrians, crossing traffic or bicycles). Althoughonly one wide-view camera 1370 is illustrated in FIG. 13B, in otherembodiments, there may be any number (including zero) of wide-viewcamera(s) 1370 on vehicle 1300. In at least one embodiment, any numberof long-range camera(s) 1398 (e.g., a long-view stereo camera pair) maybe used for depth-based object detection, especially for objects forwhich a neural network has not yet been trained. In at least oneembodiment, long-range camera(s) 1398 may also be used for objectdetection and classification, as well as basic object tracking.

In at least one embodiment, any number of stereo camera(s) 1368 may alsobe included in a front-facing configuration. In at least one embodiment,one or more of stereo camera(s) 1368 may include an integrated controlunit comprising a scalable processing unit, which may provide aprogrammable logic (“FPGA”) and a multi-core micro-processor with anintegrated Controller Area Network (“CAN”) or Ethernet interface on asingle chip. In at least one embodiment, such a unit may be used togenerate a 3D map of environment of vehicle 1300, including a distanceestimate for all points in image. In at least one embodiment, one ormore of stereo camera(s) 1368 may include, without limitation, compactstereo vision sensor(s) that may include, without limitation, two cameralenses (one each on left and right) and an image processing chip thatmay measure distance from vehicle 1300 to target object and usegenerated information (e.g., metadata) to activate autonomous emergencybraking and lane departure warning functions. In at least oneembodiment, other types of stereo camera(s) 1368 may be used in additionto, or alternatively from, those described herein.

In at least one embodiment, cameras with a field of view that includeportions of environment to side of vehicle 1300 (e.g., side-viewcameras) may be used for surround view, providing information used tocreate and update occupancy grid, as well as to generate side impactcollision warnings. For example, in at least one embodiment, surroundcamera(s) 1374 (e.g., four surround cameras 1374 as illustrated in FIG.13B) could be positioned on vehicle 1300. Surround camera(s) 1374 mayinclude, without limitation, any number and combination of wide-viewcamera(s) 1370, fisheye camera(s), 360 degree camera(s), and/or like.For instance, in at least one embodiment, four fisheye cameras may bepositioned on front, rear, and sides of vehicle 1300. In at least oneembodiment, vehicle 1300 may use three surround camera(s) 1374 (e.g.,left, right, and rear), and may leverage one or more other camera(s)(e.g., a forward-facing camera) as a fourth surround-view camera.

In at least one embodiment, cameras with a field of view that includeportions of environment to rear of vehicle 1300 (e.g., rear-viewcameras) may be used for park assistance, surround view, rear collisionwarnings, and creating and updating occupancy grid. In at least oneembodiment, a wide variety of cameras may be used including, but notlimited to, cameras that are also suitable as a front-facing camera(s)(e.g., long-range cameras 1398 and/or mid-range camera(s) 1376, stereocamera(s) 1368), infrared camera(s) 1372, etc., as described herein.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 13B for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 13C is a block diagram illustrating an example system architecturefor autonomous vehicle 1300 of FIG. 13A, according to at least oneembodiment. In at least one embodiment, each of components, features,and systems of vehicle 1300 in FIG. 13C is illustrated as beingconnected via a bus 1302. In at least one embodiment, bus 1302 mayinclude, without limitation, a CAN data interface (alternativelyreferred to herein as a “CAN bus”). In at least one embodiment, a CANmay be a network inside vehicle 1300 used to aid in control of variousfeatures and functionality of vehicle 1300, such as actuation of brakes,acceleration, braking, steering, windshield wipers, etc. In at least oneembodiment, bus 1302 may be configured to have dozens or even hundredsof nodes, each with its own unique identifier (e.g., a CAN ID). In atleast one embodiment, bus 1302 may be read to find steering wheel angle,ground speed, engine revolutions per minute (“RPMs”), button positions,and/or other vehicle status indicators. In at least one embodiment, bus1302 may be a CAN bus that is ASIL B compliant.

In at least one embodiment, in addition to, or alternatively from CAN,FlexRay and/or Ethernet may be used. In at least one embodiment, theremay be any number of busses 1302, which may include, without limitation,zero or more CAN busses, zero or more FlexRay busses, zero or moreEthernet busses, and/or zero or more other types of busses using adifferent protocol. In at least one embodiment, two or more busses 1302may be used to perform different functions, and/or may be used forredundancy. For example, a first bus 1302 may be used for collisionavoidance functionality and a second bus 1302 may be used for actuationcontrol. In at least one embodiment, each bus 1302 may communicate withany of components of vehicle 1300, and two or more busses 1302 maycommunicate with same components. In at least one embodiment, each ofany number of system(s) on chip(s) (“SoC(s)”) 1304, each ofcontroller(s) 1336, and/or each computer within vehicle may have accessto same input data (e.g., inputs from sensors of vehicle 1300), and maybe connected to a common bus, such CAN bus.

In at least one embodiment, vehicle 1300 may include one or morecontroller(s) 1336, such as those described herein with respect to FIG.13A. Controller(s) 1336 may be used for a variety of functions. In atleast one embodiment, controller(s) 1336 may be coupled to any ofvarious other components and systems of vehicle 1300, and may be usedfor control of vehicle 1300, artificial intelligence of vehicle 1300,infotainment for vehicle 1300, and/or like.

In at least one embodiment, vehicle 1300 may include any number of SoCs1304. Each of SoCs 1304 may include, without limitation, centralprocessing units (“CPU(s)”) 1306, graphics processing units (“GPU(s)”)1308, processor(s) 1310, cache(s) 1312, accelerator(s) 1314, datastore(s) 1316, and/or other components and features not illustrated. Inat least one embodiment, SoC(s) 1304 may be used to control vehicle 1300in a variety of platforms and systems. For example, in at least oneembodiment, SoC(s) 1304 may be combined in a system (e.g., system ofvehicle 1300) with a High Definition (“HD”) map 1322 which may obtainmap refreshes and/or updates via network interface 1324 from one or moreservers (not shown in FIG. 13C).

In at least one embodiment, CPU(s) 1306 may include a CPU cluster or CPUcomplex (alternatively referred to herein as a “CCPLEX”). In at leastone embodiment, CPU(s) 1306 may include multiple cores and/or level two(“L2”) caches. For instance, in at least one embodiment, CPU(s) 1306 mayinclude eight cores in a coherent multi-processor configuration. In atleast one embodiment, CPU(s) 1306 may include four dual-core clusterswhere each cluster has a dedicated L2 cache (e.g., a 2 MB L2 cache). Inat least one embodiment, CPU(s) 1306 (e.g., CCPLEX) may be configured tosupport simultaneous cluster operation enabling any combination ofclusters of CPU(s) 1306 to be active at any given time.

In at least one embodiment, one or more of CPU(s) 1306 may implementpower management capabilities that include, without limitation, one ormore of following features: individual hardware blocks may beclock-gated automatically when idle to save dynamic power; each coreclock may be gated when core is not actively executing instructions dueto execution of Wait for Interrupt (“WFI”)/Wait for Event (“WFE”)instructions; each core may be independently power-gated; each corecluster may be independently clock-gated when all cores are clock-gatedor power-gated; and/or each core cluster may be independentlypower-gated when all cores are power-gated. In at least one embodiment,CPU(s) 1306 may further implement an enhanced algorithm for managingpower states, where allowed power states and expected wakeup times arespecified, and hardware/microcode determines best power state to enterfor core, cluster, and CCPLEX. In at least one embodiment, processingcores may support simplified power state entry sequences in softwarewith work offloaded to microcode.

In at least one embodiment, GPU(s) 1308 may include an integrated GPU(alternatively referred to herein as an “iGPU”). In at least oneembodiment, GPU(s) 1308 may be programmable and may be efficient forparallel workloads. In at least one embodiment, GPU(s) 1308, in at leastone embodiment, may use an enhanced tensor instruction set. In oneembodiment, GPU(s) 1308 may include one or more streamingmicroprocessors, where each streaming microprocessor may include a levelone (“L1”) cache (e.g., an L1 cache with at least 96 KB storagecapacity), and two or more of streaming microprocessors may share an L2cache (e.g., an L2 cache with a 512 KB storage capacity). In at leastone embodiment, GPU(s) 1308 may include at least eight streamingmicroprocessors. In at least one embodiment, GPU(s) 1308 may use computeapplication programming interface(s) (API(s)). In at least oneembodiment, GPU(s) 1308 may use one or more parallel computing platformsand/or programming models (e.g., NVIDIA's CUDA).

In at least one embodiment, one or more of GPU(s) 1308 may bepower-optimized for best performance in automotive and embedded usecases. For example, in one embodiment, GPU(s) 1308 could be fabricatedon a Fin field-effect transistor (“FinFET”). In at least one embodiment,each streaming microprocessor may incorporate a number ofmixed-precision processing cores partitioned into multiple blocks. Forexample, and without limitation, 64 PF32 cores and 32 PF64 cores couldbe partitioned into four processing blocks. In at least one embodiment,each processing block could be allocated 16 FP32 cores, 8 FP64 cores, 16INT32 cores, two mixed-precision NVIDIA TENSOR COREs for deep learningmatrix arithmetic, a level zero (“L0”) instruction cache, a warpscheduler, a dispatch unit, and/or a 64 KB register file. In at leastone embodiment, streaming microprocessors may include independentparallel integer and floating-point data paths to provide for efficientexecution of workloads with a mix of computation and addressingcalculations. In at least one embodiment, streaming microprocessors mayinclude independent thread scheduling capability to enable finer-grainsynchronization and cooperation between parallel threads. In at leastone embodiment, streaming microprocessors may include a combined L1 datacache and shared memory unit in order to improve performance whilesimplifying programming.

In at least one embodiment, one or more of GPU(s) 1308 may include ahigh bandwidth memory (“HBM) and/or a 16 GB HBM2 memory subsystem toprovide, in some examples, about 900 GB/second peak memory bandwidth. Inat least one embodiment, in addition to, or alternatively from, HBMmemory, a synchronous graphics random-access memory (“SGRAM”) may beused, such as a graphics double data rate type five synchronousrandom-access memory (“GDDR5”).

In at least one embodiment, GPU(s) 1308 may include unified memorytechnology. In at least one embodiment, address translation services(“ATS”) support may be used to allow GPU(s) 1308 to access CPU(s) 1306page tables directly. In at least one embodiment, when GPU(s) 1308memory management unit (“MMU”) experiences a miss, an addresstranslation request may be transmitted to CPU(s) 1306. In response,CPU(s) 1306 may look in its page tables for virtual-to-physical mappingfor address and transmits translation back to GPU(s) 1308, in at leastone embodiment. In at least one embodiment, unified memory technologymay allow a single unified virtual address space for memory of bothCPU(s) 1306 and GPU(s) 1308, thereby simplifying GPU(s) 1308 programmingand porting of applications to GPU(s) 1308.

In at least one embodiment, GPU(s) 1308 may include any number of accesscounters that may keep track of frequency of access of GPU(s) 1308 tomemory of other processors. In at least one embodiment, accesscounter(s) may help ensure that memory pages are moved to physicalmemory of processor that is accessing pages most frequently, therebyimproving efficiency for memory ranges shared between processors.

In at least one embodiment, one or more of SoC(s) 1304 may include anynumber of cache(s) 1312, including those described herein. For example,in at least one embodiment, cache(s) 1312 could include a level three(“L3”) cache that is available to both CPU(s) 1306 and GPU(s) 1308(e.g., that is connected both CPU(s) 1306 and GPU(s) 1308). In at leastone embodiment, cache(s) 1312 may include a write-back cache that maykeep track of states of lines, such as by using a cache coherenceprotocol (e.g., MEI, MESI, MSI, etc.). In at least one embodiment, L3cache may include 4 MB or more, depending on embodiment, althoughsmaller cache sizes may be used.

In at least one embodiment, one or more of SoC(s) 1304 may include oneor more accelerator(s) 1314 (e.g., hardware accelerators, softwareaccelerators, or a combination thereof). In at least one embodiment,SoC(s) 1304 may include a hardware acceleration cluster that may includeoptimized hardware accelerators and/or large on-chip memory. In at leastone embodiment, large on-chip memory (e.g., 4 MB of SRAM), may enablehardware acceleration cluster to accelerate neural networks and othercalculations. In at least one embodiment, hardware acceleration clustermay be used to complement GPU(s) 1308 and to off-load some of tasks ofGPU(s) 1308 (e.g., to free up more cycles of GPU(s) 1308 for performingother tasks). In at least one embodiment, accelerator(s) 1314 could beused for targeted workloads (e.g., perception, convolutional neuralnetworks (“CNNs”), recurrent neural networks (“RNNs”), etc.) that arestable enough to be amenable to acceleration. In at least oneembodiment, a CNN may include a region-based or regional convolutionalneural networks (“RCNNs”) and Fast RCNNs (e.g., as used for objectdetection) or other type of CNN.

In at least one embodiment, accelerator(s) 1314 (e.g., hardwareacceleration cluster) may include a deep learning accelerator(s) (“DLA).DLA(s) may include, without limitation, one or more Tensor processingunits (“TPUs) that may be configured to provide an additional tentrillion operations per second for deep learning applications andinferencing. In at least one embodiment, TPUs may be acceleratorsconfigured to, and optimized for, performing image processing functions(e.g., for CNNs, RCNNs, etc.). DLA(s) may further be optimized for aspecific set of neural network types and floating point operations, aswell as inferencing. In at least one embodiment, design of DLA(s) mayprovide more performance per millimeter than a typical general-purposeGPU, and typically vastly exceeds performance of a CPU. In at least oneembodiment, TPU(s) may perform several functions, including asingle-instance convolution function, supporting, for example, INT8,INT16, and FP16 data types for both features and weights, as well aspost-processor functions. In at least one embodiment, DLA(s) may quicklyand efficiently execute neural networks, especially CNNs, on processedor unprocessed data for any of a variety of functions, including, forexample and without limitation: a CNN for object identification anddetection using data from camera sensors; a CNN for distance estimationusing data from camera sensors; a CNN for emergency vehicle detectionand identification and detection using data from microphones 1396; a CNNfor facial recognition and vehicle owner identification using data fromcamera sensors; and/or a CNN for security and/or safety related events.

In at least one embodiment, DLA(s) may perform any function of GPU(s)1308, and by using an inference accelerator, for example, a designer maytarget either DLA(s) or GPU(s) 1308 for any function. For example, in atleast one embodiment, designer may focus processing of CNNs and floatingpoint operations on DLA(s) and leave other functions to GPU(s) 1308and/or other accelerator(s) 1314.

In at least one embodiment, accelerator(s) 1314 (e.g., hardwareacceleration cluster) may include a programmable vision accelerator(s)(“PVA”), which may alternatively be referred to herein as a computervision accelerator. In at least one embodiment, PVA(s) may be designedand configured to accelerate computer vision algorithms for advanceddriver assistance system (“ADAS”) 1338, autonomous driving, augmentedreality (“AR”) applications, and/or virtual reality (“VR”) applications.PVA(s) may provide a balance between performance and flexibility. Forexample, in at least one embodiment, each PVA(s) may include, forexample and without limitation, any number of reduced instruction setcomputer (“RISC”) cores, direct memory access (“DMA”), and/or any numberof vector processors.

In at least one embodiment, RISC cores may interact with image sensors(e.g., image sensors of any of cameras described herein), image signalprocessor(s), and/or like. In at least one embodiment, each of RISCcores may include any amount of memory. In at least one embodiment, RISCcores may use any of a number of protocols, depending on embodiment. Inat least one embodiment, RISC cores may execute a real-time operatingsystem (“RTOS”). In at least one embodiment, RISC cores may beimplemented using one or more integrated circuit devices, applicationspecific integrated circuits (“ASICs”), and/or memory devices. Forexample, in at least one embodiment, RISC cores could include aninstruction cache and/or a tightly coupled RAM.

In at least one embodiment, DMA may enable components of PVA(s) toaccess system memory independently of CPU(s) 1306. In at least oneembodiment, DMA may support any number of features used to provideoptimization to PVA including, but not limited to, supportingmulti-dimensional addressing and/or circular addressing. In at least oneembodiment, DMA may support up to six or more dimensions of addressing,which may include, without limitation, block width, block height, blockdepth, horizontal block stepping, vertical block stepping, and/or depthstepping.

In at least one embodiment, vector processors may be programmableprocessors that may be designed to efficiently and flexibly executeprogramming for computer vision algorithms and provide signal processingcapabilities. In at least one embodiment, PVA may include a PVA core andtwo vector processing subsystem partitions. In at least one embodiment,PVA core may include a processor subsystem, DMA engine(s) (e.g., two DMAengines), and/or other peripherals. In at least one embodiment, vectorprocessing subsystem may operate as primary processing engine of PVA,and may include a vector processing unit (“VPU”), an instruction cache,and/or vector memory (e.g., “VMEM”). In at least one embodiment, VPUcore may include a digital signal processor such as, for example, asingle instruction, multiple data (“SIMD”), very long instruction word(“VLIW”) digital signal processor. In at least one embodiment, acombination of SIMD and VLIW may enhance throughput and speed.

In at least one embodiment, each of vector processors may include aninstruction cache and may be coupled to dedicated memory. As a result,in at least one embodiment, each of vector processors may be configuredto execute independently of other vector processors. In at least oneembodiment, vector processors that are included in a particular PVA maybe configured to employ data parallelism. For instance, in at least oneembodiment, plurality of vector processors included in a single PVA mayexecute same computer vision algorithm, but on different regions of animage. In at least one embodiment, vector processors included in aparticular PVA may simultaneously execute different computer visionalgorithms, on same image, or even execute different algorithms onsequential images or portions of an image. In at least one embodiment,among other things, any number of PVAs may be included in hardwareacceleration cluster and any number of vector processors may be includedin each of PVAs. In at least one embodiment, PVA(s) may includeadditional error correcting code (“ECC”) memory, to enhance overallsystem safety.

In at least one embodiment, accelerator(s) 1314 (e.g., hardwareacceleration cluster) may include a computer vision network on-chip andstatic random-access memory (“SRAM”), for providing a high-bandwidth,low latency SRAM for accelerator(s) 1314. In at least one embodiment,on-chip memory may include at least 4 MB SRAM, consisting of, forexample and without limitation, eight field-configurable memory blocks,that may be accessible by both PVA and DLA. In at least one embodiment,each pair of memory blocks may include an advanced peripheral bus(“APB”) interface, configuration circuitry, a controller, and amultiplexer. In at least one embodiment, any type of memory may be used.In at least one embodiment, PVA and DLA may access memory via a backbonethat provides PVA and DLA with high-speed access to memory. In at leastone embodiment, backbone may include a computer vision network on-chipthat interconnects PVA and DLA to memory (e.g., using APB).

In at least one embodiment, computer vision network on-chip may includean interface that determines, before transmission of any controlsignal/address/data, that both PVA and DLA provide ready and validsignals. In at least one embodiment, an interface may provide forseparate phases and separate channels for transmitting controlsignals/addresses/data, as well as burst-type communications forcontinuous data transfer. In at least one embodiment, an interface maycomply with International Organization for Standardization (“ISO”) 26262or International Electrotechnical Commission (“IEC”) 61508 standards,although other standards and protocols may be used.

In at least one embodiment, one or more of SoC(s) 1304 may include areal-time ray-tracing hardware accelerator. In at least one embodiment,real-time ray-tracing hardware accelerator may be used to quickly andefficiently determine positions and extents of objects (e.g., within aworld model), to generate real-time visualization simulations, for RADARsignal interpretation, for sound propagation synthesis and/or analysis,for simulation of SONAR systems, for general wave propagationsimulation, for comparison to LIDAR data for purposes of localizationand/or other functions, and/or for other uses.

In at least one embodiment, accelerator(s) 1314 (e.g., hardwareaccelerator cluster) have a wide array of uses for autonomous driving.In at least one embodiment, PVA may be a programmable vision acceleratorthat may be used for key processing stages in ADAS and autonomousvehicles. In at least one embodiment, PVA's capabilities are a goodmatch for algorithmic domains needing predictable processing, at lowpower and low latency. In other words, PVA performs well on semi-denseor dense regular computation, even on small data sets, which needpredictable run-times with low latency and low power. In at least oneembodiment, autonomous vehicles, such as vehicle 1300, PVAs are designedto run classic computer vision algorithms, as they are efficient atobject detection and operating on integer math.

For example, according to at least one embodiment of technology, PVA isused to perform computer stereo vision. In at least one embodiment,semi-global matching-based algorithm may be used in some examples,although this is not intended to be limiting. In at least oneembodiment, applications for Level 3-5 autonomous driving use motionestimation/stereo matching on-the-fly (e.g., structure from motion,pedestrian recognition, lane detection, etc.). In at least oneembodiment, PVA may perform computer stereo vision function on inputsfrom two monocular cameras.

In at least one embodiment, PVA may be used to perform dense opticalflow. For example, in at least one embodiment, PVA could process rawRADAR data (e.g., using a 4D Fast Fourier Transform) to provideprocessed RADAR data. In at least one embodiment, PVA is used for timeof flight depth processing, by processing raw time of flight data toprovide processed time of flight data, for example.

In at least one embodiment, DLA may be used to run any type of networkto enhance control and driving safety, including for example and withoutlimitation, a neural network that outputs a measure of confidence foreach object detection. In at least one embodiment, confidence may berepresented or interpreted as a probability, or as providing a relative“weight” of each detection compared to other detections. In at least oneembodiment, confidence enables a system to make further decisionsregarding which detections should be considered as true positivedetections rather than false positive detections. For example, in atleast one embodiment, a system may set a threshold value for confidenceand consider only detections exceeding threshold value as true positivedetections. In an embodiment in which an automatic emergency braking(“AEB”) system is used, false positive detections would cause vehicle toautomatically perform emergency braking, which is obviously undesirable.In at least one embodiment, highly confident detections may beconsidered as triggers for AEB In at least one embodiment, DLA may run aneural network for regressing confidence value. In at least oneembodiment, neural network may take as its input at least some subset ofparameters, such as bounding box dimensions, ground plane estimateobtained (e.g. from another subsystem), output from IMU sensor(s) 1366that correlates with vehicle 1300 orientation, distance, 3D locationestimates of object obtained from neural network and/or other sensors(e.g., LIDAR sensor(s) 1364 or RADAR sensor(s) 1360), among others.

In at least one embodiment, one or more of SoC(s) 1304 may include datastore(s) 1316 (e.g., memory). In at least one embodiment, data store(s)1316 may be on-chip memory of SoC(s) 1304, which may store neuralnetworks to be executed on GPU(s) 1308 and/or DLA. In at least oneembodiment, data store(s) 1316 may be large enough in capacity to storemultiple instances of neural networks for redundancy and safety. In atleast one embodiment, data store(s) 1312 may comprise L2 or L3 cache(s).

In at least one embodiment, one or more of SoC(s) 1304 may include anynumber of processor(s) 1310 (e.g., embedded processors). Processor(s)1310 may include a boot and power management processor that may be adedicated processor and subsystem to handle boot power and managementfunctions and related security enforcement. In at least one embodiment,boot and power management processor may be a part of SoC(s) 1304 bootsequence and may provide runtime power management services. In at leastone embodiment, boot power and management processor may provide clockand voltage programming, assistance in system low power statetransitions, management of SoC(s) 1304 thermals and temperature sensors,and/or management of SoC(s) 1304 power states. In at least oneembodiment, each temperature sensor may be implemented as aring-oscillator whose output frequency is proportional to temperature,and SoC(s) 1304 may use ring-oscillators to detect temperatures ofCPU(s) 1306, GPU(s) 1308, and/or accelerator(s) 1314. In at least oneembodiment, if temperatures are determined to exceed a threshold, thenboot and power management processor may enter a temperature faultroutine and put SoC(s) 1304 into a lower power state and/or put vehicle1300 into a chauffeur to safe stop mode (e.g., bring vehicle 1300 to asafe stop).

In at least one embodiment, processor(s) 1310 may further include a setof embedded processors that may serve as an audio processing engine. Inat least one embodiment, audio processing engine may be an audiosubsystem that enables full hardware support for multi-channel audioover multiple interfaces, and a broad and flexible range of audio I/Ointerfaces. In at least one embodiment, audio processing engine is adedicated processor core with a digital signal processor with dedicatedRAM.

In at least one embodiment, processor(s) 1310 may further include analways on processor engine that may provide necessary hardware featuresto support low power sensor management and wake use cases. In at leastone embodiment, always on processor engine may include, withoutlimitation, a processor core, a tightly coupled RAM, supportingperipherals (e.g., timers and interrupt controllers), various I/Ocontroller peripherals, and routing logic.

In at least one embodiment, processor(s) 1310 may further include asafety cluster engine that includes, without limitation, a dedicatedprocessor subsystem to handle safety management for automotiveapplications. In at least one embodiment, safety cluster engine mayinclude, without limitation, two or more processor cores, a tightlycoupled RAM, support peripherals (e.g., timers, an interrupt controller,etc.), and/or routing logic. In a safety mode, two or more cores mayoperate, in at least one embodiment, in a lockstep mode and function asa single core with comparison logic to detect any differences betweentheir operations. In at least one embodiment, processor(s) 1310 mayfurther include a real-time camera engine that may include, withoutlimitation, a dedicated processor subsystem for handling real-timecamera management. In at least one embodiment, processor(s) 1310 mayfurther include a high-dynamic range signal processor that may include,without limitation, an image signal processor that is a hardware enginethat is part of camera processing pipeline.

In at least one embodiment, processor(s) 1310 may include a video imagecompositor that may be a processing block (e.g., implemented on amicroprocessor) that implements video post-processing functions neededby a video playback application to produce final image for playerwindow. In at least one embodiment, video image compositor may performlens distortion correction on wide-view camera(s) 1370, surroundcamera(s) 1374, and/or on in-cabin monitoring camera sensor(s). In atleast one embodiment, in-cabin monitoring camera sensor(s) arepreferably monitored by a neural network running on another instance ofSoC 1304, configured to identify in cabin events and respondaccordingly. In at least one embodiment, an in-cabin system may perform,without limitation, lip reading to activate cellular service and place aphone call, dictate emails, change vehicle's destination, activate orchange vehicle's infotainment system and settings, or providevoice-activated web surfing. In at least one embodiment, certainfunctions are available to driver when vehicle is operating in anautonomous mode and are disabled otherwise.

In at least one embodiment, video image compositor may include enhancedtemporal noise reduction for both spatial and temporal noise reduction.For example, in at least one embodiment, where motion occurs in a video,noise reduction weights spatial information appropriately, decreasingweight of information provided by adjacent frames. In at least oneembodiment, where an image or portion of an image does not includemotion, temporal noise reduction performed by video image compositor mayuse information from previous image to reduce noise in current image.

In at least one embodiment, video image compositor may also beconfigured to perform stereo rectification on input stereo lens frames.In at least one embodiment, video image compositor may further be usedfor user interface composition when operating system desktop is in use,and GPU(s) 1308 are not required to continuously render new surfaces. Inat least one embodiment, when GPU(s) 1308 are powered on and activedoing 3D rendering, video image compositor may be used to offload GPU(s)1308 to improve performance and responsiveness.

In at least one embodiment, one or more of SoC(s) 1304 may furtherinclude a mobile industry processor interface (“MIPI”) camera serialinterface for receiving video and input from cameras, a high-speedinterface, and/or a video input block that may be used for camera andrelated pixel input functions. In at least one embodiment, one or moreof SoC(s) 1304 may further include an input/output controller(s) thatmay be controlled by software and may be used for receiving I/O signalsthat are uncommitted to a specific role.

In at least one embodiment, one or more of SoC(s) 1304 may furtherinclude a broad range of peripheral interfaces to enable communicationwith peripherals, audio encoders/decoders (“codecs”), power management,and/or other devices. SoC(s) 1304 may be used to process data fromcameras (e.g., connected over Gigabit Multimedia Serial Link andEthernet), sensors (e.g., LIDAR sensor(s) 1364, RADAR sensor(s) 1360,etc., that may be connected over Ethernet), data from bus 1302 (e.g.,speed of vehicle 1300, steering wheel position, etc.), data from GNSSsensor(s) 1358 (e.g., connected over Ethernet or CAN bus), etc. In atleast one embodiment, one or more of SoC(s) 1304 may further includededicated high-performance mass storage controllers that may includetheir own DMA engines, and that may be used to free CPU(s) 1306 fromroutine data management tasks.

In at least one embodiment, SoC(s) 1304 may be an end-to-end platformwith a flexible architecture that spans automation levels 3-5, therebyproviding a comprehensive functional safety architecture that leveragesand makes efficient use of computer vision and ADAS techniques fordiversity and redundancy, provides a platform for a flexible, reliabledriving software stack, along with deep learning tools. In at least oneembodiment, SoC(s) 1304 may be faster, more reliable, and even moreenergy-efficient and space-efficient than conventional systems. Forexample, in at least one embodiment, accelerator(s) 1314, when combinedwith CPU(s) 1306, GPU(s) 1308, and data store(s) 1316, may provide for afast, efficient platform for level 3-5 autonomous vehicles.

In at least one embodiment, computer vision algorithms may be executedon CPUs, which may be configured using high-level programming language,such as C programming language, to execute a wide variety of processingalgorithms across a wide variety of visual data. However, in at leastone embodiment, CPUs are oftentimes unable to meet performancerequirements of many computer vision applications, such as those relatedto execution time and power consumption, for example. In at least oneembodiment, many CPUs are unable to execute complex object detectionalgorithms in real-time, which is used in in-vehicle ADAS applicationsand in practical Level 3-5 autonomous vehicles.

Embodiments described herein allow for multiple neural networks to beperformed simultaneously and/or sequentially, and for results to becombined together to enable Level 3-5 autonomous driving functionality.For example, in at least one embodiment, a CNN executing on DLA ordiscrete GPU (e.g., GPU(s) 1320) may include text and word recognition,allowing supercomputer to read and understand traffic signs, includingsigns for which neural network has not been specifically trained. In atleast one embodiment, DLA may further include a neural network that isable to identify, interpret, and provide semantic understanding of sign,and to pass that semantic understanding to path planning modules runningon CPU Complex.

In at least one embodiment, multiple neural networks may be runsimultaneously, as for Level 3, 4, or 5 driving. For example, in atleast one embodiment, a warning sign consisting of “Caution: flashinglights indicate icy conditions,” along with an electric light, may beindependently or collectively interpreted by several neural networks. Inat least one embodiment, sign itself may be identified as a traffic signby a first deployed neural network (e.g., a neural network that has beentrained), text “flashing lights indicate icy conditions” may beinterpreted by a second deployed neural network, which informs vehicle'spath planning software (preferably executing on CPU Complex) that whenflashing lights are detected, icy conditions exist. In at least oneembodiment, flashing light may be identified by operating a thirddeployed neural network over multiple frames, informing vehicle'spath-planning software of presence (or absence) of flashing lights. Inat least one embodiment, all three neural networks may runsimultaneously, such as within DLA and/or on GPU(s) 1308.

In at least one embodiment, a CNN for facial recognition and vehicleowner identification may use data from camera sensors to identifypresence of an authorized driver and/or owner of vehicle 1300. In atleast one embodiment, an always on sensor processing engine may be usedto unlock vehicle when owner approaches driver door and turn on lights,and, in security mode, to disable vehicle when owner leaves vehicle. Inthis way, SoC(s) 1304 provide for security against theft and/orcarjacking.

In at least one embodiment, a CNN for emergency vehicle detection andidentification may use data from microphones 1396 to detect and identifyemergency vehicle sirens. In at least one embodiment, SoC(s) 1304 useCNN for classifying environmental and urban sounds, as well asclassifying visual data. In at least one embodiment, CNN running on DLAis trained to identify relative closing speed of emergency vehicle(e.g., by using Doppler effect). In at least one embodiment, CNN mayalso be trained to identify emergency vehicles specific to local area inwhich vehicle is operating, as identified by GNSS sensor(s) 1358. In atleast one embodiment, when operating in Europe, CNN will seek to detectEuropean sirens, and when in United States CNN will seek to identifyonly North American sirens. In at least one embodiment, once anemergency vehicle is detected, a control program may be used to executean emergency vehicle safety routine, slowing vehicle, pulling over toside of road, parking vehicle, and/or idling vehicle, with assistance ofultrasonic sensor(s) 1362, until emergency vehicle(s) passes.

In at least one embodiment, vehicle 1300 may include CPU(s) 1318 (e.g.,discrete CPU(s), or dCPU(s)), that may be coupled to SoC(s) 1304 via ahigh-speed interconnect (e.g., PCIe). In at least one embodiment, CPU(s)1318 may include an X86 processor, for example. CPU(s) 1318 may be usedto perform any of a variety of functions, including arbitratingpotentially inconsistent results between ADAS sensors and SoC(s) 1304,and/or monitoring status and health of controller(s) 1336 and/or aninfotainment system on a chip (“infotainment SoC”) 1330, for example.

In at least one embodiment, vehicle 1300 may include GPU(s) 1320 (e.g.,discrete GPU(s), or dGPU(s)), that may be coupled to SoC(s) 1304 via ahigh-speed interconnect (e.g., NVIDIA's NVLINK). In at least oneembodiment, GPU(s) 1320 may provide additional artificial intelligencefunctionality, such as by executing redundant and/or different neuralnetworks, and may be used to train and/or update neural networks basedat least in part on input (e.g., sensor data) from sensors of vehicle1300.

In at least one embodiment, vehicle 1300 may further include networkinterface 1324 which may include, without limitation, wirelessantenna(s) 1326 (e.g., one or more wireless antennas 1326 for differentcommunication protocols, such as a cellular antenna, a Bluetoothantenna, etc.). In at least one embodiment, network interface 1324 maybe used to enable wireless connectivity over Internet with cloud (e.g.,with server(s) and/or other network devices), with other vehicles,and/or with computing devices (e.g., client devices of passengers). Inat least one embodiment, to communicate with other vehicles, a directlink may be established between vehicle 130 and other vehicle and/or anindirect link may be established (e.g., across networks and overInternet). In at least one embodiment, direct links may be providedusing a vehicle-to-vehicle communication link. Vehicle-to-vehiclecommunication link may provide vehicle 1300 information about vehiclesin proximity to vehicle 1300 (e.g., vehicles in front of, on side of,and/or behind vehicle 1300). In at least one embodiment, aforementionedfunctionality may be part of a cooperative adaptive cruise controlfunctionality of vehicle 1300.

In at least one embodiment, network interface 1324 may include an SoCthat provides modulation and demodulation functionality and enablescontroller(s) 1336 to communicate over wireless networks. In at leastone embodiment, network interface 1324 may include a radio frequencyfront-end for up-conversion from baseband to radio frequency, and downconversion from radio frequency to baseband. In at least one embodiment,frequency conversions may be performed in any technically feasiblefashion. For example, frequency conversions could be performed throughwell-known processes, and/or using super-heterodyne processes. In atleast one embodiment, radio frequency front end functionality may beprovided by a separate chip. In at least one embodiment, networkinterface may include wireless functionality for communicating over LTE,WCDMA, UMTS, GSM, CDMA2000, Bluetooth, Bluetooth LE, Wi-Fi, Z-Wave,ZigBee, LoRaWAN, and/or other wireless protocols.

In at least one embodiment, vehicle 1300 may further include datastore(s) 1328 which may include, without limitation, off-chip (e.g., offSoC(s) 1304) storage. In at least one embodiment, data store(s) 1328 mayinclude, without limitation, one or more storage elements including RAM,SRAM, dynamic random-access memory (“DRAM”), video random-access memory(“VRAM”), Flash, hard disks, and/or other components and/or devices thatmay store at least one bit of data.

In at least one embodiment, vehicle 1300 may further include GNSSsensor(s) 1358 (e.g., GPS and/or assisted GPS sensors), to assist inmapping, perception, occupancy grid generation, and/or path planningfunctions. In at least one embodiment, any number of GNSS sensor(s) 1358may be used, including, for example and without limitation, a GPS usinga USB connector with an Ethernet to Serial (e.g., RS-232) bridge.

In at least one embodiment, vehicle 1300 may further include RADARsensor(s) 1360. RADAR sensor(s) 1360 may be used by vehicle 1300 forlong-range vehicle detection, even in darkness and/or severe weatherconditions. In at least one embodiment, RADAR functional safety levelsmay be ASIL B. RADAR sensor(s) 1360 may use CAN and/or bus 1302 (e.g.,to transmit data generated by RADAR sensor(s) 1360) for control and toaccess object tracking data, with access to Ethernet to access raw datain some examples. In at least one embodiment, wide variety of RADARsensor types may be used. For example, and without limitation, RADARsensor(s) 1360 may be suitable for front, rear, and side RADAR use. Inat least one embodiment, one or more of RADAR sensors(s) 1360 are PulseDoppler RADAR sensor(s).

In at least one embodiment, RADAR sensor(s) 1360 may include differentconfigurations, such as long-range with narrow field of view,short-range with wide field of view, short-range side coverage, etc. Inat least one embodiment, long-range RADAR may be used for adaptivecruise control functionality. In at least one embodiment, long-rangeRADAR systems may provide a broad field of view realized by two or moreindependent scans, such as within a 250 m range. In at least oneembodiment, RADAR sensor(s) 1360 may help in distinguishing betweenstatic and moving objects, and may be used by ADAS system 1338 foremergency brake assist and forward collision warning. Sensors 1360(s)included in a long-range RADAR system may include, without limitation,monostatic multimodal RADAR with multiple (e.g., six or more) fixedRADAR antennae and a high-speed CAN and FlexRay interface. In at leastone embodiment, with six antennae, central four antennae may create afocused beam pattern, designed to record vehicle's 1300 surroundings athigher speeds with minimal interference from traffic in adjacent lanes.In at least one embodiment, other two antennae may expand field of view,making it possible to quickly detect vehicles entering or leavingvehicle's 1300 lane.

In at least one embodiment, mid-range RADAR systems may include, as anexample, a range of up to 160 m (front) or 80 m (rear), and a field ofview of up to 42 degrees (front) or 150 degrees (rear). In at least oneembodiment, short-range RADAR systems may include, without limitation,any number of RADAR sensor(s) 1360 designed to be installed at both endsof rear bumper. When installed at both ends of rear bumper, in at leastone embodiment, a RADAR sensor system may create two beams thatconstantly monitor blind spot in rear and next to vehicle. In at leastone embodiment, short-range RADAR systems may be used in ADAS system1338 for blind spot detection and/or lane change assist.

In at least one embodiment, vehicle 1300 may further include ultrasonicsensor(s) 1362. Ultrasonic sensor(s) 1362, which may be positioned atfront, back, and/or sides of vehicle 1300, may be used for park assistand/or to create and update an occupancy grid. In at least oneembodiment, a wide variety of ultrasonic sensor(s) 1362 may be used, anddifferent ultrasonic sensor(s) 1362 may be used for different ranges ofdetection (e.g., 2.5 m, 4 m). In at least one embodiment, ultrasonicsensor(s) 1362 may operate at functional safety levels of ASIL B.

In at least one embodiment, vehicle 1300 may include LIDAR sensor(s)1364. LIDAR sensor(s) 1364 may be used for object and pedestriandetection, emergency braking, collision avoidance, and/or otherfunctions. In at least one embodiment, LIDAR sensor(s) 1364 may befunctional safety level ASIL B. In at least one embodiment, vehicle 1300may include multiple LIDAR sensors 1364 (e.g., two, four, six, etc.)that may use Ethernet (e.g., to provide data to a Gigabit Ethernetswitch).

In at least one embodiment, LIDAR sensor(s) 1364 may be capable ofproviding a list of objects and their distances for a 360-degree fieldof view. In at least one embodiment, commercially available LIDARsensor(s) 1364 may have an advertised range of approximately 100 m, withan accuracy of 2 cm-3 cm, and with support for a 100 Mbps Ethernetconnection, for example. In at least one embodiment, one or morenon-protruding LIDAR sensors 1364 may be used. In such an embodiment,LIDAR sensor(s) 1364 may be implemented as a small device that may beembedded into front, rear, sides, and/or corners of vehicle 1300. In atleast one embodiment, LIDAR sensor(s) 1364, in such an embodiment, mayprovide up to a 120-degree horizontal and 35-degree verticalfield-of-view, with a 200 m range even for low-reflectivity objects. Inat least one embodiment, front-mounted LIDAR sensor(s) 1364 may beconfigured for a horizontal field of view between 45 degrees and 135degrees.

In at least one embodiment, LIDAR technologies, such as 3D flash LIDAR,may also be used. 3D Flash LIDAR uses a flash of a laser as atransmission source, to illuminate surroundings of vehicle 1300 up toapproximately 200 m. In at least one embodiment, a flash LIDAR unitincludes, without limitation, a receptor, which records laser pulsetransit time and reflected light on each pixel, which in turncorresponds to range from vehicle 1300 to objects. In at least oneembodiment, flash LIDAR may allow for highly accurate anddistortion-free images of surroundings to be generated with every laserflash. In at least one embodiment, four flash LIDAR sensors may bedeployed, one at each side of vehicle 1300. In at least one embodiment,3D flash LIDAR systems include, without limitation, a solid-state 3Dstaring array LIDAR camera with no moving parts other than a fan (e.g.,a non-scanning LIDAR device). In at least one embodiment, flash LIDARdevice may use a 5 nanosecond class I (eye-safe) laser pulse per frameand may capture reflected laser light in form of 3D range point cloudsand co-registered intensity data.

In at least one embodiment, vehicle may further include IMU sensor(s)1366. In at least one embodiment, IMU sensor(s) 1366 may be located at acenter of rear axle of vehicle 1300, in at least one embodiment. In atleast one embodiment, IMU sensor(s) 1366 may include, for example andwithout limitation, accelerometer(s), magnetometer(s), gyroscope(s),magnetic compass(es), and/or other sensor types. In at least oneembodiment, such as in six-axis applications, IMU sensor(s) 1366 mayinclude, without limitation, accelerometers and gyroscopes. In at leastone embodiment, such as in nine-axis applications, IMU sensor(s) 1366may include, without limitation, accelerometers, gyroscopes, andmagnetometers.

In at least one embodiment, IMU sensor(s) 1366 may be implemented as aminiature, high performance GPS-Aided Inertial Navigation System(“GPS/INS”) that combines micro-electro-mechanical systems (“MEMS”)inertial sensors, a high-sensitivity GPS receiver, and advanced Kalmanfiltering algorithms to provide estimates of position, velocity, andattitude. In at least one embodiment, IMU sensor(s) 1366 may enablevehicle 1300 to estimate heading without requiring input from a magneticsensor by directly observing and correlating changes in velocity fromGPS to IMU sensor(s) 1366. In at least one embodiment, IMU sensor(s)1366 and GNSS sensor(s) 1358 may be combined in a single integratedunit.

In at least one embodiment, vehicle 1300 may include microphone(s) 1396placed in and/or around vehicle 1300. In at least one embodiment,microphone(s) 1396 may be used for emergency vehicle detection andidentification, among other things.

In at least one embodiment, vehicle 1300 may further include any numberof camera types, including stereo camera(s) 1368, wide-view camera(s)1370, infrared camera(s) 1372, surround camera(s) 1374, long-rangecamera(s) 1398, mid-range camera(s) 1376, and/or other camera types. Inat least one embodiment, cameras may be used to capture image dataaround an entire periphery of vehicle 1300. In at least one embodiment,types of cameras used depends on vehicle 1300. In at least oneembodiment, any combination of camera types may be used to providenecessary coverage around vehicle 1300. In at least one embodiment,number of cameras may differ depending on embodiment. For example, in atleast one embodiment, vehicle 1300 could include six cameras, sevencameras, ten cameras, twelve cameras, or another number of cameras.Cameras may support, as an example and without limitation, GigabitMultimedia Serial Link (“GMSL”) and/or Gigabit Ethernet. In at least oneembodiment, each of camera(s) is described with more detail previouslyherein with respect to FIG. 13A and FIG. 13B.

In at least one embodiment, vehicle 1300 may further include vibrationsensor(s) 1342. Vibration sensor(s) 1342 may measure vibrations ofcomponents of vehicle 1300, such as axle(s). For example, in at leastone embodiment, changes in vibrations may indicate a change in roadsurfaces. In at least one embodiment, when two or more vibration sensors1342 are used, differences between vibrations may be used to determinefriction or slippage of road surface (e.g., when difference in vibrationis between a power-driven axle and a freely rotating axle).

In at least one embodiment, vehicle 1300 may include ADAS system 1338.ADAS system 1338 may include, without limitation, an SoC, in someexamples. In at least one embodiment, ADAS system 1338 may include,without limitation, any number and combination of anautonomous/adaptive/automatic cruise control (“ACC”) system, acooperative adaptive cruise control (“CACC”) system, a forward crashwarning (“FCW”) system, an automatic emergency braking (“AEB”) system, alane departure warning (“LDW)” system, a lane keep assist (“LKA”)system, a blind spot warning (“BSW”) system, a rear cross-trafficwarning (“RCTW”) system, a collision warning (“CW”) system, a lanecentering (“LC”) system, and/or other systems, features, and/orfunctionality.

In at least one embodiment, ACC system may use RADAR sensor(s) 1360,LIDAR sensor(s) 1364, and/or any number of camera(s). In at least oneembodiment, ACC system may include a longitudinal ACC system and/or alateral ACC system. In at least one embodiment, longitudinal ACC systemmonitors and controls distance to vehicle immediately ahead of vehicle1300 and automatically adjusts speed of vehicle 1300 to maintain a safedistance from vehicles ahead. In at least one embodiment, lateral ACCsystem performs distance keeping, and advises vehicle 1300 to changelanes when necessary. In at least one embodiment, lateral ACC is relatedto other ADAS applications such as LC and CW.

In at least one embodiment, CACC system uses information from othervehicles that may be received via network interface 1324 and/or wirelessantenna(s) 1326 from other vehicles via a wireless link, or indirectly,over a network connection (e.g., over Internet). In at least oneembodiment, direct links may be provided by a vehicle-to-vehicle (“V2V”)communication link, while indirect links may be provided by aninfrastructure-to-vehicle (“I2V”) communication link. In general, V2Vcommunication concept provides information about immediately precedingvehicles (e.g., vehicles immediately ahead of and in same lane asvehicle 1300), while I2V communication concept provides informationabout traffic further ahead. In at least one embodiment, CACC system mayinclude either or both I2V and V2V information sources. In at least oneembodiment, given information of vehicles ahead of vehicle 1300, CACCsystem may be more reliable and it has potential to improve traffic flowsmoothness and reduce congestion on road.

In at least one embodiment, FCW system is designed to alert driver to ahazard, so that driver may take corrective action. In at least oneembodiment, FCW system uses a front-facing camera and/or RADAR sensor(s)1360, coupled to a dedicated processor, DSP, FPGA, and/or ASIC, that iselectrically coupled to driver feedback, such as a display, speaker,and/or vibrating component. In at least one embodiment, FCW system mayprovide a warning, such as in form of a sound, visual warning, vibrationand/or a quick brake pulse.

In at least one embodiment, AEB system detects an impending forwardcollision with another vehicle or other object, and may automaticallyapply brakes if driver does not take corrective action within aspecified time or distance parameter. In at least one embodiment, AEBsystem may use front-facing camera(s) and/or RADAR sensor(s) 1360,coupled to a dedicated processor, DSP, FPGA, and/or ASIC. In at leastone embodiment, when AEB system detects a hazard, AEB system typicallyfirst alerts driver to take corrective action to avoid collision and, ifdriver does not take corrective action, AEB system may automaticallyapply brakes in an effort to prevent, or at least mitigate, impact ofpredicted collision. In at least one embodiment, AEB system may includetechniques such as dynamic brake support and/or crash imminent braking.

In at least one embodiment, LDW system provides visual, audible, and/ortactile warnings, such as steering wheel or seat vibrations, to alertdriver when vehicle 1300 crosses lane markings. In at least oneembodiment, LDW system does not activate when driver indicates anintentional lane departure, by activating a turn signal. In at least oneembodiment, LDW system may use front-side facing cameras, coupled to adedicated processor, DSP, FPGA, and/or ASIC, that is electricallycoupled to driver feedback, such as a display, speaker, and/or vibratingcomponent. In at least one embodiment, LKA system is a variation of LDWsystem. LKA system provides steering input or braking to correct vehicle1300 if vehicle 1300 starts to exit lane.

In at least one embodiment, BSW system detects and warns driver ofvehicles in an automobile's blind spot. In at least one embodiment, BSWsystem may provide a visual, audible, and/or tactile alert to indicatethat merging or changing lanes is unsafe. In at least one embodiment,BSW system may provide an additional warning when driver uses a turnsignal. In at least one embodiment, BSW system may use rear-side facingcamera(s) and/or RADAR sensor(s) 1360, coupled to a dedicated processor,DSP, FPGA, and/or ASIC, that is electrically coupled to driver feedback,such as a display, speaker, and/or vibrating component.

In at least one embodiment, RCTW system may provide visual, audible,and/or tactile notification when an object is detected outsiderear-camera range when vehicle 1300 is backing up. In at least oneembodiment, RCTW system includes AEB system to ensure that vehiclebrakes are applied to avoid a crash. In at least one embodiment, RCTWsystem may use one or more rear-facing RADAR sensor(s) 1360, coupled toa dedicated processor, DSP, FPGA, and/or ASIC, that is electricallycoupled to driver feedback, such as a display, speaker, and/or vibratingcomponent.

In at least one embodiment, conventional ADAS systems may be prone tofalse positive results which may be annoying and distracting to adriver, but typically are not catastrophic, because conventional ADASsystems alert driver and allow driver to decide whether a safetycondition truly exists and act accordingly. In at least one embodiment,vehicle 1300 itself decides, in case of conflicting results, whether toheed result from a primary computer or a secondary computer (e.g., firstcontroller 1336 or second controller 1336). For example, in at least oneembodiment, ADAS system 1338 may be a backup and/or secondary computerfor providing perception information to a backup computer rationalitymodule. In at least one embodiment, backup computer rationality monitormay run a redundant diverse software on hardware components to detectfaults in perception and dynamic driving tasks. In at least oneembodiment, outputs from ADAS system 1338 may be provided to asupervisory MCU. In at least one embodiment, if outputs from primarycomputer and secondary computer conflict, supervisory MCU determines howto reconcile conflict to ensure safe operation.

In at least one embodiment, primary computer may be configured toprovide supervisory MCU with a confidence score, indicating primarycomputer's confidence in chosen result. In at least one embodiment, ifconfidence score exceeds a threshold, supervisory MCU may follow primarycomputer's direction, regardless of whether secondary computer providesa conflicting or inconsistent result. In at least one embodiment, whereconfidence score does not meet threshold, and where primary andsecondary computer indicate different results (e.g., a conflict),supervisory MCU may arbitrate between computers to determine appropriateoutcome.

In at least one embodiment, supervisory MCU may be configured to run aneural network(s) that is trained and configured to determine, based atleast in part on outputs from primary computer and secondary computer,conditions under which secondary computer provides false alarms. In atleast one embodiment, neural network(s) in supervisory MCU may learnwhen secondary computer's output may be trusted and when it cannot. Forexample, in at least one embodiment, when secondary computer is aRADAR-based FCW system, a neural network(s) in supervisory MCU may learnwhen FCW system is identifying metallic objects that are not, in fact,hazards, such as a drainage grate or manhole cover that triggers analarm. In at least one embodiment, when secondary computer is acamera-based LDW system, a neural network in supervisory MCU may learnto override LDW when bicyclists or pedestrians are present and a lanedeparture is, in fact, safest maneuver. In at least one embodiment,supervisory MCU may include at least one of a DLA or GPU suitable forrunning neural network(s) with associated memory. In at least oneembodiment, supervisory MCU may comprise and/or be included as acomponent of SoC(s) 1304.

In at least one embodiment, ADAS system 1338 may include a secondarycomputer that performs ADAS functionality using traditional rules ofcomputer vision. In at least one embodiment, secondary computer may useclassic computer vision rules (if-then), and presence of a neuralnetwork(s) in supervisory MCU may improve reliability, safety andperformance. For example, in at least one embodiment, diverseimplementation and intentional non-identity makes overall system morefault-tolerant, especially to faults caused by software (orsoftware-hardware interface) functionality. For example, in at least oneembodiment, if there is a software bug or error in software running onprimary computer, and non-identical software code running on secondarycomputer provides same overall result, then supervisory MCU may havegreater confidence that overall result is correct, and bug in softwareor hardware on primary computer is not causing material error.

In at least one embodiment, output of ADAS system 1338 may be fed intoprimary computer's perception block and/or primary computer's dynamicdriving task block. For example, in at least one embodiment, if ADASsystem 1338 indicates a forward crash warning due to an objectimmediately ahead, perception block may use this information whenidentifying objects. In at least one embodiment, secondary computer mayhave its own neural network which is trained and thus reduces risk offalse positives, as described herein.

In at least one embodiment, vehicle 1300 may further includeinfotainment SoC 1330 (e.g., an in-vehicle infotainment system (IVI)).Although illustrated and described as an SoC, infotainment system 1330,in at least one embodiment, may not be an SoC, and may include, withoutlimitation, two or more discrete components. In at least one embodiment,infotainment SoC 1330 may include, without limitation, a combination ofhardware and software that may be used to provide audio (e.g., music, apersonal digital assistant, navigational instructions, news, radio,etc.), video (e.g., TV, movies, streaming, etc.), phone (e.g.,hands-free calling), network connectivity (e.g., LTE, WiFi, etc.),and/or information services (e.g., navigation systems, rear-parkingassistance, a radio data system, vehicle related information such asfuel level, total distance covered, brake fuel level, oil level, dooropen/close, air filter information, etc.) to vehicle 1300. For example,infotainment SoC 1330 could include radios, disk players, navigationsystems, video players, USB and Bluetooth connectivity, carputers,in-car entertainment, WiFi, steering wheel audio controls, hands freevoice control, a heads-up display (“HUD”), HMI display 1334, atelematics device, a control panel (e.g., for controlling and/orinteracting with various components, features, and/or systems), and/orother components. In at least one embodiment, infotainment SoC 1330 mayfurther be used to provide information (e.g., visual and/or audible) touser(s) of vehicle, such as information from ADAS system 1338,autonomous driving information such as planned vehicle maneuvers,trajectories, surrounding environment information (e.g., intersectioninformation, vehicle information, road information, etc.), and/or otherinformation.

In at least one embodiment, infotainment SoC 1330 may include any amountand type of GPU functionality. In at least one embodiment, infotainmentSoC 1330 may communicate over bus 1302 (e.g., CAN bus, Ethernet, etc.)with other devices, systems, and/or components of vehicle 1300. In atleast one embodiment, infotainment SoC 1330 may be coupled to asupervisory MCU such that GPU of infotainment system may perform someself-driving functions in event that primary controller(s) 1336 (e.g.,primary and/or backup computers of vehicle 1300) fail. In at least oneembodiment, infotainment SoC 1330 may put vehicle 1300 into a chauffeurto safe stop mode, as described herein.

In at least one embodiment, vehicle 1300 may further include instrumentcluster 1332 (e.g., a digital dash, an electronic instrument cluster, adigital instrument panel, etc.). Instrument cluster 1332 may include,without limitation, a controller and/or supercomputer (e.g., a discretecontroller or supercomputer). In at least one embodiment, instrumentcluster 1332 may include, without limitation, any number and combinationof a set of instrumentation such as a speedometer, fuel level, oilpressure, tachometer, odometer, turn indicators, gearshift positionindicator, seat belt warning light(s), parking-brake warning light(s),engine-malfunction light(s), supplemental restraint system (e.g.,airbag) information, lighting controls, safety system controls,navigation information, etc. In some examples, information may bedisplayed and/or shared among infotainment SoC 1330 and instrumentcluster 1332. In at least one embodiment, instrument cluster 1332 may beincluded as part of infotainment SoC 1330, or vice versa.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 13C for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 13D is a diagram of a system 1376 for communication betweencloud-based server(s) and autonomous vehicle 1300 of FIG. 13A, accordingto at least one embodiment. In at least one embodiment, system 1376 mayinclude, without limitation, server(s) 1378, network(s) 1390, and anynumber and type of vehicles, including vehicle 1300. server(s) 1378 mayinclude, without limitation, a plurality of GPUs 1384(A)-1384(H)(collectively referred to herein as GPUs 1384), PCIe switches1382(A)-1382(H) (collectively referred to herein as PCIe switches 1382),and/or CPUs 1380(A)-1380(B) (collectively referred to herein as CPUs1380). GPUs 1384, CPUs 1380, and PCIe switches 1382 may beinterconnected with high-speed interconnects such as, for example andwithout limitation, NVLink interfaces 1388 developed by NVIDIA and/orPCIe connections 1386. In at least one embodiment, GPUs 1384 areconnected via an NVLink and/or NVSwitch SoC and GPUs 1384 and PCIeswitches 1382 are connected via PCIe interconnects. In at least oneembodiment, although eight GPUs 1384, two CPUs 1380, and four PCIeswitches 1382 are illustrated, this is not intended to be limiting. Inat least one embodiment, each of server(s) 1378 may include, withoutlimitation, any number of GPUs 1384, CPUs 1380, and/or PCIe switches1382, in any combination. For example, in at least one embodiment,server(s) 1378 could each include eight, sixteen, thirty-two, and/ormore GPUs 1384.

In at least one embodiment, server(s) 1378 may receive, over network(s)1390 and from vehicles, image data representative of images showingunexpected or changed road conditions, such as recently commencedroad-work. In at least one embodiment, server(s) 1378 may transmit, overnetwork(s) 1390 and to vehicles, neural networks 1392, updated neuralnetworks 1392, and/or map information 1394, including, withoutlimitation, information regarding traffic and road conditions. In atleast one embodiment, updates to map information 1394 may include,without limitation, updates for HD map 1322, such as informationregarding construction sites, potholes, detours, flooding, and/or otherobstructions. In at least one embodiment, neural networks 1392, updatedneural networks 1392, and/or map information 1394 may have resulted fromnew training and/or experiences represented in data received from anynumber of vehicles in environment, and/or based at least in part ontraining performed at a data center (e.g., using server(s) 1378 and/orother servers).

In at least one embodiment, server(s) 1378 may be used to train machinelearning models (e.g., neural networks) based at least in part ontraining data. Training data may be generated by vehicles, and/or may begenerated in a simulation (e.g., using a game engine). In at least oneembodiment, any amount of training data is tagged (e.g., whereassociated neural network benefits from supervised learning) and/orundergoes other pre-processing. In at least one embodiment, any amountof training data is not tagged and/or pre-processed (e.g., whereassociated neural network does not require supervised learning). In atleast one embodiment, once machine learning models are trained, machinelearning models may be used by vehicles, transmitted to vehicles overnetwork(s) 1390, and/or machine learning models may be used by server(s)1378 to remotely monitor vehicles.

In at least one embodiment, server(s) 1378 may receive data fromvehicles and apply data to up-to-date real-time neural networks forreal-time intelligent inferencing. In at least one embodiment, server(s)1378 may include deep-learning supercomputers and/or dedicated AIcomputers powered by GPU(s) 1384, such as a DGX and DGX Station machinesdeveloped by NVIDIA. However, in at least one embodiment, server(s) 1378may include deep learning infrastructure that use CPU-powered datacenters.

In at least one embodiment, deep-learning infrastructure of server(s)1378 may be capable of fast, real-time inferencing, and may use thatcapability to evaluate and verify health of processors, software, and/orassociated hardware in vehicle 1300. For example, in at least oneembodiment, deep-learning infrastructure may receive periodic updatesfrom vehicle 1300, such as a sequence of images and/or objects thatvehicle 1300 has located in that sequence of images (e.g., via computervision and/or other machine learning object classification techniques).In at least one embodiment, deep-learning infrastructure may run its ownneural network to identify objects and compare them with objectsidentified by vehicle 1300 and, if results do not match anddeep-learning infrastructure concludes that AI in vehicle 1300 ismalfunctioning, then server(s) 1378 may transmit a signal to vehicle1300 instructing a fail-safe computer of vehicle 1300 to assume control,notify passengers, and complete a safe parking maneuver.

In at least one embodiment, server(s) 1378 may include GPU(s) 1384 andone or more programmable inference accelerators (e.g., NVIDIA's TensorRT3). In at least one embodiment, combination of GPU-powered servers andinference acceleration may make real-time responsiveness possible. In atleast one embodiment, such as where performance is less critical,servers powered by CPUs, FPGAs, and other processors may be used forinferencing. In at least one embodiment, hardware structure(s) 1015 areused to perform one or more embodiments. Details regarding hardwarestructure(x) 1015 are provided herein in conjunction with FIGS. 10Aand/or 10B.

Computer Systems

FIG. 14 is a block diagram illustrating an exemplary computer system,which may be a system with interconnected devices and components, asystem-on-a-chip (SOC) or some combination thereof 1400 formed with aprocessor that may include execution units to execute an instruction,according to at least one embodiment. In at least one embodiment,computer system 1400 may include, without limitation, a component, suchas a processor 1402 to employ execution units including logic to performalgorithms for process data, in accordance with present disclosure, suchas in embodiment described herein. In at least one embodiment, computersystem 1400 may include processors, such as PENTIUM® Processor family,Xeon™, Itanium®, XScale™ and/or StrongARM™, Intel® Core™, or Intel®Nervana™ microprocessors available from Intel Corporation of SantaClara, Calif., although other systems (including PCs having othermicroprocessors, engineering workstations, set-top boxes and like) mayalso be used. In at least one embodiment, computer system 1400 mayexecute a version of WINDOWS' operating system available from MicrosoftCorporation of Redmond, Wash., although other operating systems (UNIXand Linux for example), embedded software, and/or graphical userinterfaces, may also be used.

Embodiments may be used in other devices such as handheld devices andembedded applications. Some examples of handheld devices includecellular phones, Internet Protocol devices, digital cameras, personaldigital assistants (“PDAs”), and handheld PCs. In at least oneembodiment, embedded applications may include a microcontroller, adigital signal processor (“DSP”), system on a chip, network computers(“NetPCs”), set-top boxes, network hubs, wide area network (“WAN”)switches, or any other system that may perform one or more instructionsin accordance with at least one embodiment.

In at least one embodiment, computer system 1400 may include, withoutlimitation, processor 1402 that may include, without limitation, one ormore execution units 1408 to perform machine learning model trainingand/or inferencing according to techniques described herein. In at leastone embodiment, system 14 is a single processor desktop or serversystem, but in another embodiment system 14 may be a multiprocessorsystem. In at least one embodiment, processor 1402 may include, withoutlimitation, a complex instruction set computer (“CISC”) microprocessor,a reduced instruction set computing (“RISC”) microprocessor, a very longinstruction word (“VLIW”) microprocessor, a processor implementing acombination of instruction sets, or any other processor device, such asa digital signal processor, for example. In at least one embodiment,processor 1402 may be coupled to a processor bus 1410 that may transmitdata signals between processor 1402 and other components in computersystem 1400.

In at least one embodiment, processor 1402 may include, withoutlimitation, a Level 1 (“L1”) internal cache memory (“cache”) 1404. In atleast one embodiment, processor 1402 may have a single internal cache ormultiple levels of internal cache. In at least one embodiment, cachememory may reside external to processor 1402. Other embodiments may alsoinclude a combination of both internal and external caches depending onparticular implementation and needs. In at least one embodiment,register file 1406 may store different types of data in variousregisters including, without limitation, integer registers, floatingpoint registers, status registers, and instruction pointer register.

In at least one embodiment, execution unit 1408, including, withoutlimitation, logic to perform integer and floating point operations, alsoresides in processor 1402. Processor 1402 may also include a microcode(“ucode”) read only memory (“ROM”) that stores microcode for certainmacro instructions. In at least one embodiment, execution unit 1408 mayinclude logic to handle a packed instruction set 1409. In at least oneembodiment, by including packed instruction set 1409 in instruction setof a general-purpose processor 1402, along with associated circuitry toexecute instructions, operations used by many multimedia applicationsmay be performed using packed data in a general-purpose processor 1402.In one or more embodiments, many multimedia applications may beaccelerated and executed more efficiently by using full width of aprocessor's data bus for performing operations on packed data, which mayeliminate need to transfer smaller units of data across processor's databus to perform one or more operations one data element at a time.

In at least one embodiment, execution unit 1408 may also be used inmicrocontrollers, embedded processors, graphics devices, DSPs, and othertypes of logic circuits. In at least one embodiment, computer system1400 may include, without limitation, a memory 1420. In at least oneembodiment, memory 1420 may be implemented as a Dynamic Random AccessMemory (“DRAM”) device, a Static Random Access Memory (“SRAM”) device,flash memory device, or other memory device. Memory 1420 may storeinstruction(s) 1419 and/or data 1421 represented by data signals thatmay be executed by processor 1402.

In at least one embodiment, system logic chip may be coupled toprocessor bus 1410 and memory 1420. In at least one embodiment, systemlogic chip may include, without limitation, a memory controller hub(“MCH”) 1416, and processor 1402 may communicate with MCH 1416 viaprocessor bus 1410. In at least one embodiment, MCH 1416 may provide ahigh bandwidth memory path 1418 to memory 1420 for instruction and datastorage and for storage of graphics commands, data and textures. In atleast one embodiment, MCH 1416 may direct data signals between processor1402, memory 1420, and other components in computer system 1400 and tobridge data signals between processor bus 1410, memory 1420, and asystem I/O 1422. In at least one embodiment, system logic chip mayprovide a graphics port for coupling to a graphics controller. In atleast one embodiment, MCH 1416 may be coupled to memory 1420 through ahigh bandwidth memory path 1418 and graphics/video card 1412 may becoupled to MCH 1416 through an Accelerated Graphics Port (“AGP”)interconnect 1414.

In at least one embodiment, computer system 1400 may use system I/O 1422that is a proprietary hub interface bus to couple MCH 1416 to I/Ocontroller hub (“ICH”) 1430. In at least one embodiment, ICH 1430 mayprovide direct connections to some I/O devices via a local I/O bus. Inat least one embodiment, local I/O bus may include, without limitation,a high-speed I/O bus for connecting peripherals to memory 1420, chipset,and processor 1402. Examples may include, without limitation, an audiocontroller 1429, a firmware hub (“flash BIOS”) 1428, a wirelesstransceiver 1426, a data storage 1424, a legacy I/O controller 1423containing user input and keyboard interfaces, a serial expansion port1427, such as Universal Serial Bus (“USB”), and a network controller1434. Data storage 1424 may comprise a hard disk drive, a floppy diskdrive, a CD-ROM device, a flash memory device, or other mass storagedevice.

In at least one embodiment, FIG. 14 illustrates a system, which includesinterconnected hardware devices or “chips”, whereas in otherembodiments, FIG. 14 may illustrate an exemplary System on a Chip(“SoC”). In at least one embodiment, devices illustrated in FIG. cc maybe interconnected with proprietary interconnects, standardizedinterconnects (e.g., PCIe) or some combination thereof. In at least oneembodiment, one or more components of system 1400 are interconnectedusing compute express link (CXL) interconnects.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 14 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 15 is a block diagram illustrating an electronic device 1500 forutilizing a processor 1510, according to at least one embodiment. In atleast one embodiment, electronic device 1500 may be, for example andwithout limitation, a notebook, a tower server, a rack server, a bladeserver, a laptop, a desktop, a tablet, a mobile device, a phone, anembedded computer, or any other suitable electronic device.

In at least one embodiment, system 1500 may include, without limitation,processor 1510 communicatively coupled to any suitable number or kind ofcomponents, peripherals, modules, or devices. In at least oneembodiment, processor 1510 coupled using a bus or interface, such as a1° C. bus, a System Management Bus (“SMBus”), a Low Pin Count (LPC) bus,a Serial Peripheral Interface (“SPI”), a High Definition Audio (“HDA”)bus, a Serial Advance Technology Attachment (“SATA”) bus, a UniversalSerial Bus (“USB”) (versions 1, 2, 3), or a Universal AsynchronousReceiver/Transmitter (“UART”) bus. In at least one embodiment, FIG. 15illustrates a system, which includes interconnected hardware devices or“chips”, whereas in other embodiments, FIG. 15 may illustrate anexemplary System on a Chip (“SoC”). In at least one embodiment, devicesillustrated in FIG. 15 may be interconnected with proprietaryinterconnects, standardized interconnects (e.g., PCIe) or somecombination thereof. In at least one embodiment, one or more componentsof FIG. 15 are interconnected using compute express link (CXL)interconnects.

In at least one embodiment, FIG. 15 may include a display 1524, a touchscreen 1525, a touch pad 1530, a Near Field Communications unit (“NFC”)1545, a sensor hub 1540, a thermal sensor 1546, an Express Chipset(“EC”) 1535, a Trusted Platform Module (“TPM”) 1538, BIOS/firmware/flashmemory (“BIOS, FW Flash”) 1522, a DSP 1560, a drive “SSD or HDD” 1520such as a Solid State Disk (“SSD”) or a Hard Disk Drive (“HDD”), awireless local area network unit (“WLAN”) 1550, a Bluetooth unit 1552, aWireless Wide Area Network unit (“WWAN”) 1556, a Global PositioningSystem (GPS) 1555, a camera (“USB 3.0 camera”) 1554 such as a USB 3.0camera, or a Low Power Double Data Rate (“LPDDR”) memory unit (“LPDDR3”)1515 implemented in, for example, LPDDR3 standard. These components mayeach be implemented in any suitable manner.

In at least one embodiment, other components may be communicativelycoupled to processor 1510 through components discussed above. In atleast one embodiment, an accelerometer 1541, Ambient Light Sensor(“ALS”) 1542, compass 1543, and a gyroscope 1544 may be communicativelycoupled to sensor hub 1540. In at least one embodiment, thermal sensor1539, a fan 1537, a keyboard 1546, and a touch pad 1530 may becommunicatively coupled to EC 1535. In at least one embodiment, speaker1563, a headphones 1564, and a microphone (“mic”) 1565 may becommunicatively coupled to an audio unit (“audio codec and class d amp”)1564, which may in turn be communicatively coupled to DSP 1560. In atleast one embodiment, audio unit 1564 may include, for example andwithout limitation, an audio coder/decoder (“codec”) and a class Damplifier. In at least one embodiment, SIM card (“SIM”) 1557 may becommunicatively coupled to WWAN unit 1556. In at least one embodiment,components such as WLAN unit 1550 and Bluetooth unit 1552, as well asWWAN unit 1556 may be implemented in a Next Generation Form Factor(“NGFF”).

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 15 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 16 illustrates a computer system 1600, according to at least oneembodiment. In at least one embodiment, computer system 1600 isconfigured to implement various processes and methods describedthroughout this disclosure.

In at least one embodiment, computer system 1600 comprises, withoutlimitation, at least one central processing unit (“CPU”) 1602 that isconnected to a communication bus 1610 implemented using any suitableprotocol, such as PCI (“Peripheral Component Interconnect”), peripheralcomponent interconnect express (“PCI-Express”), AGP (“AcceleratedGraphics Port”), HyperTransport, or any other bus or point-to-pointcommunication protocol(s). In at least one embodiment, computer system1600 includes, without limitation, a main memory 1604 and control logic(e.g., implemented as hardware, software, or a combination thereof) anddata are stored in main memory 1604 which may take form of random accessmemory (“RAM”). In at least one embodiment, a network interfacesubsystem (“network interface”) 1622 provides an interface to othercomputing devices and networks for receiving data from and transmittingdata to other systems from computer system 1600.

In at least one embodiment, computer system 1600, in at least oneembodiment, includes, without limitation, input devices 1608, parallelprocessing system 1612, and display devices 1606 which can beimplemented using a conventional cathode ray tube (“CRT”), liquidcrystal display (“LCD”), light emitting diode (“LED”), plasma display,or other suitable display technologies. In at least one embodiment, userinput is received from input devices 1608 such as keyboard, mouse,touchpad, microphone, and more. In at least one embodiment, each offoregoing modules can be situated on a single semiconductor platform toform a processing system.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 16 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 17 illustrates a computer system 1700, according to at least oneembodiment. In at least one embodiment, computer system 1700 includes,without limitation, a computer 1710 and a USB stick 1720. In at leastone embodiment, computer 1710 may include, without limitation, anynumber and type of processor(s) (not shown) and a memory (not shown). Inat least one embodiment, computer 1710 includes, without limitation, aserver, a cloud instance, a laptop, and a desktop computer.

In at least one embodiment, USB stick 1720 includes, without limitation,a processing unit 1730, a USB interface 1740, and USB interface logic1750. In at least one embodiment, processing unit 1730 may be anyinstruction execution system, apparatus, or device capable of executinginstructions. In at least one embodiment, processing unit 1730 mayinclude, without limitation, any number and type of processing cores(not shown). In at least one embodiment, processing core 1730 comprisesan application specific integrated circuit (“ASIC”) that is optimized toperform any amount and type of operations associated with machinelearning. For instance, in at least one embodiment, processing core 1730is a tensor processing unit (“TPC”) that is optimized to perform machinelearning inference operations. In at least one embodiment, processingcore 1730 is a vision processing unit (“VPU”) that is optimized toperform machine vision and machine learning inference operations.

In at least one embodiment, USB interface 1740 may be any type of USBconnector or USB socket. For instance, in at least one embodiment, USBinterface 1740 is a USB 3.0 Type-C socket for data and power. In atleast one embodiment, USB interface 1740 is a USB 3.0 Type-A connector.In at least one embodiment, USB interface logic 1750 may include anyamount and type of logic that enables processing unit 1730 to interfacewith or devices (e.g., computer 1710) via USB connector 1740.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 17 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 18A illustrates an exemplary architecture in which a plurality ofGPUs 1810-1813 is communicatively coupled to a plurality of multi-coreprocessors 1805-1806 over high-speed links 1840-1843 (e.g., buses,point-to-point interconnects, etc.). In one embodiment, high-speed links1840-1843 support a communication throughput of 4 GB/s, 30 GB/s, 80 GB/sor higher. Various interconnect protocols may be used including, but notlimited to, PCIe 4.0 or 5.0 and NVLink 2.0.

In addition, and in one embodiment, two or more of GPUs 1810-1813 areinterconnected over high-speed links 1829-1830, which may be implementedusing same or different protocols/links than those used for high-speedlinks 1840-1843. Similarly, two or more of multi-core processors1805-1806 may be connected over high speed link 1828 which may besymmetric multi-processor (SMP) buses operating at 20 GB/s, 30 GB/s, 120GB/s or higher. Alternatively, all communication between various systemcomponents shown in FIG. 18A may be accomplished using sameprotocols/links (e.g., over a common interconnection fabric).

In one embodiment, each multi-core processor 1805-1806 iscommunicatively coupled to a processor memory 1801-1802, via memoryinterconnects 1826-1827, respectively, and each GPU 1810-1813 iscommunicatively coupled to GPU memory 1820-1823 over GPU memoryinterconnects 1850-1853, respectively. Memory interconnects 1826-1827and 1850-1853 may utilize same or different memory access technologies.By way of example, and not limitation, processor memories 1801-1802 andGPU memories 1820-1823 may be volatile memories such as dynamic randomaccess memories (DRAMs) (including stacked DRAMs), Graphics DDR SDRAM(GDDR) (e.g., GDDR5, GDDR6), or High Bandwidth Memory (HBM) and/or maybe non-volatile memories such as 3D XPoint or Nano-Ram. In oneembodiment, some portion of processor memories 1801-1802 may be volatilememory and another portion may be non-volatile memory (e.g., using atwo-level memory (2LM) hierarchy).

As described herein, although various processors 1805-1806 and GPUs1810-1813 may be physically coupled to a particular memory 1801-1802,1820-1823, respectively, a unified memory architecture may beimplemented in which a same virtual system address space (also referredto as “effective address” space) is distributed among various physicalmemories. For example, processor memories 1801-1802 may each comprise 64GB of system memory address space and GPU memories 1820-1823 may eachcomprise 32 GB of system memory address space (resulting in a total of256 GB addressable memory in this example).

FIG. 18B illustrates additional details for an interconnection between amulti-core processor 1807 and a graphics acceleration module 1846 inaccordance with one exemplary embodiment. Graphics acceleration module1846 may include one or more GPU chips integrated on a line card whichis coupled to processor 1807 via high-speed link 1840. Alternatively,graphics acceleration module 1846 may be integrated on a same package orchip as processor 1807.

In at least one embodiment, illustrated processor 1807 includes aplurality of cores 1860A-1860D, each with a translation lookaside buffer1861A-1861D and one or more caches 1862A-1862D. In at least oneembodiment, cores 1860A-1860D may include various other components forexecuting instructions and processing data which are not illustrated.Caches 1862A-1862D may comprise level 1 (L1) and level 2 (L2) caches. Inaddition, one or more shared caches 1856 may be included in caches1862A-1862D and shared by sets of cores 1860A-1860D. For example, oneembodiment of processor 1807 includes 24 cores, each with its own L1cache, twelve shared L2 caches, and twelve shared L3 caches. In thisembodiment, one or more L2 and L3 caches are shared by two adjacentcores. Processor 1807 and graphics acceleration module 1846 connect withsystem memory 1814, which may include processor memories 1801-1802 ofFIG. 18A.

Coherency is maintained for data and instructions stored in variouscaches 1862A-1862D, 1856 and system memory 1814 via inter-corecommunication over a coherence bus 1864. For example, each cache mayhave cache coherency logic/circuitry associated therewith to communicateto over coherence bus 1864 in response to detected reads or writes toparticular cache lines. In one implementation, a cache snooping protocolis implemented over coherence bus 1864 to snoop cache accesses.

In one embodiment, a proxy circuit 1825 communicatively couples graphicsacceleration module 1846 to coherence bus 1864, allowing graphicsacceleration module 1846 to participate in a cache coherence protocol asa peer of cores 1860A-1860D. In particular, an interface 1835 providesconnectivity to proxy circuit 1825 over high-speed link 1840 (e.g., aPCIe bus, NVLink, etc.) and an interface 1837 connects graphicsacceleration module 1846 to link 1840.

In one implementation, an accelerator integration circuit 1836 providescache management, memory access, context management, and interruptmanagement services on behalf of a plurality of graphics processingengines 1831, 1832, N of graphics acceleration module 1846. Graphicsprocessing engines 1831, 1832, N may each comprise a separate graphicsprocessing unit (GPU). Alternatively, graphics processing engines 1831,1832, N may comprise different types of graphics processing engineswithin a GPU such as graphics execution units, media processing engines(e.g., video encoders/decoders), samplers, and blit engines. In at leastone embodiment, graphics acceleration module 1846 may be a GPU with aplurality of graphics processing engines 1831-1832, N or graphicsprocessing engines 1831-1832, N may be individual GPUs integrated on acommon package, line card, or chip.

In one embodiment, accelerator integration circuit 1836 includes amemory management unit (MMU) 1839 for performing various memorymanagement functions such as virtual-to-physical memory translations(also referred to as effective-to-real memory translations) and memoryaccess protocols for accessing system memory 1814. MMU 1839 may alsoinclude a translation lookaside buffer (TLB) (not shown) for cachingvirtual/effective to physical/real address translations. In oneimplementation, a cache 1838 stores commands and data for efficientaccess by graphics processing engines 1831-1832, N. In one embodiment,data stored in cache 1838 and graphics memories 1833-1834, M is keptcoherent with core caches 1862A-1862D, 1856 and system memory 1814. Asmentioned, this may be accomplished via proxy circuit 1825 on behalf ofcache 1838 and memories 1833-1834, M (e.g., sending updates to cache1838 related to modifications/accesses of cache lines on processorcaches 1862A-1862D, 1856 and receiving updates from cache 1838).

A set of registers 1845 store context data for threads executed bygraphics processing engines 1831-1832, N and a context managementcircuit 1848 manages thread contexts. For example, context managementcircuit 1848 may perform save and restore operations to save and restorecontexts of various threads during contexts switches (e.g., where afirst thread is saved and a second thread is stored so that a secondthread can be execute by a graphics processing engine). For example, ona context switch, context management circuit 1848 may store currentregister values to a designated region in memory (e.g., identified by acontext pointer). It may then restore register values when returning toa context. In one embodiment, an interrupt management circuit 1847receives and processes interrupts received from system devices.

In one implementation, virtual/effective addresses from a graphicsprocessing engine 1831 are translated to real/physical addresses insystem memory 1814 by MMU 1839. One embodiment of acceleratorintegration circuit 1836 supports multiple (e.g., 4, 8, 16) graphicsaccelerator modules 1846 and/or other accelerator devices. Graphicsaccelerator module 1846 may be dedicated to a single applicationexecuted on processor 1807 or may be shared between multipleapplications. In one embodiment, a virtualized graphics executionenvironment is presented in which resources of graphics processingengines 1831-1832, N are shared with multiple applications or virtualmachines (VMs). In at least one embodiment, resources may be subdividedinto “slices” which are allocated to different VMs and/or applicationsbased on processing requirements and priorities associated with VMsand/or applications.

In at least one embodiment, accelerator integration circuit 1836performs as a bridge to a system for graphics acceleration module 1846and provides address translation and system memory cache services. Inaddition, accelerator integration circuit 1836 may providevirtualization facilities for a host processor to manage virtualizationof graphics processing engines 1831-1832, interrupts, and memorymanagement.

Because hardware resources of graphics processing engines 1831-1832, Nare mapped explicitly to a real address space seen by host processor1807, any host processor can address these resources directly using aneffective address value. One function of accelerator integration circuit1836, in one embodiment, is physical separation of graphics processingengines 1831-1832, N so that they appear to a system as independentunits.

In at least one embodiment, one or more graphics memories 1833-1834, Mare coupled to each of graphics processing engines 1831-1832, N,respectively. Graphics memories 1833-1834, M store instructions and databeing processed by each of graphics processing engines 1831-1832, N.Graphics memories 1833-1834, M may be volatile memories such as DRAMs(including stacked DRAMs), GDDR memory (e.g., GDDR5, GDDR6), or HBM,and/or may be non-volatile memories such as 3D)(Point or Nano-Ram.

In one embodiment, to reduce data traffic over link 1840, biasingtechniques are used to ensure that data stored in graphics memories1833-1834, M is data which will be used most frequently by graphicsprocessing engines 1831-1832, N and preferably not used by cores1860A-1860D (at least not frequently). Similarly, a biasing mechanismattempts to keep data needed by cores (and preferably not graphicsprocessing engines 1831-1832, N) within caches 1862A-1862D, 1856 ofcores and system memory 1814.

FIG. 18C illustrates another exemplary embodiment in which acceleratorintegration circuit 1836 is integrated within processor 1807. In thisembodiment, graphics processing engines 1831-1832, N communicatedirectly over high-speed link 1840 to accelerator integration circuit1836 via interface 1837 and interface 1835 (which, again, may be utilizeany form of bus or interface protocol). Accelerator integration circuit1836 may perform same operations as those described with respect to FIG.18B, but potentially at a higher throughput given its close proximity tocoherence bus 1864 and caches 1862A-1862D, 1856. One embodiment supportsdifferent programming models including a dedicated-process programmingmodel (no graphics acceleration module virtualization) and sharedprogramming models (with virtualization), which may include programmingmodels which are controlled by accelerator integration circuit 1836 andprogramming models which are controlled by graphics acceleration module1846.

In at least one embodiment, graphics processing engines 1831-1832, N arededicated to a single application or process under a single operatingsystem. In at least one embodiment, a single application can funnelother application requests to graphics processing engines 1831-1832, N,providing virtualization within a VM/partition.

In at least one embodiment, graphics processing engines 1831-1832, N,may be shared by multiple VM/application partitions. In at least oneembodiment, shared models may use a system hypervisor to virtualizegraphics processing engines 1831-1832, N to allow access by eachoperating system. For single-partition systems without a hypervisor,graphics processing engines 1831-1832, N are owned by an operatingsystem. In at least one embodiment, an operating system can virtualizegraphics processing engines 1831-1832, N to provide access to eachprocess or application.

In at least one embodiment, graphics acceleration module 1846 or anindividual graphics processing engine 1831-1832, N selects a processelement using a process handle. In one embodiment, process elements arestored in system memory 1814 and are addressable using an effectiveaddress to real address translation techniques described herein. In atleast one embodiment, a process handle may be an implementation-specificvalue provided to a host process when registering its context withgraphics processing engine 1831-1832, N (that is, calling systemsoftware to add a process element to a process element linked list). Inat least one embodiment, a lower 16-bits of a process handle may be anoffset of process element within a process element linked list.

FIG. 18D illustrates an exemplary accelerator integration slice 1890. Asused herein, a “slice” comprises a specified portion of processingresources of accelerator integration circuit 1836. Application effectiveaddress space 1882 within system memory 1814 stores process elements1883. In one embodiment, process elements 1883 are stored in response toGPU invocations 1881 from applications 1880 executed on processor 1807.A process element 1883 contains process state for correspondingapplication 1880. A work descriptor (WD) 1884 contained in processelement 1883 can be a single job requested by an application or maycontain a pointer to a queue of jobs. In at least one embodiment, WD1884 is a pointer to a job request queue in an application's addressspace 1882.

Graphics acceleration module 1846 and/or individual graphics processingengines 1831-1832, N can be shared by all or a subset of processes in asystem. In at least one embodiment, an infrastructure for setting upprocess state and sending a WD 1884 to a graphics acceleration module1846 to start a job in a virtualized environment may be included.

In at least one embodiment, a dedicated-process programming model isimplementation-specific. In this model, a single process owns graphicsacceleration module 1846 or an individual graphics processing engine1831. Because graphics acceleration module 1846 is owned by a singleprocess, a hypervisor initializes accelerator integration circuit 1836for an owning partition and an operating system initializes acceleratorintegration circuit 1836 for an owning process when graphicsacceleration module 1846 is assigned.

In operation, a WD fetch unit 1891 in accelerator integration slice 1890fetches next WD 1884 which includes an indication of work to be done byone or more graphics processing engines of graphics acceleration module1846. Data from WD 1884 may be stored in registers 1845 and used by MMU1839, interrupt management circuit 1847 and/or context managementcircuit 1848 as illustrated. For example, one embodiment of MMU 1839includes segment/page walk circuitry for accessing segment/page tables1886 within OS virtual address space 1885. Interrupt management circuit1847 may process interrupt events 1892 received from graphicsacceleration module 1846. When performing graphics operations, aneffective address 1893 generated by a graphics processing engine1831-1832, N is translated to a real address by MMU 1839.

In one embodiment, a same set of registers 1845 are duplicated for eachgraphics processing engine 1831-1832, N and/or graphics accelerationmodule 1846 and may be initialized by a hypervisor or operating system.Each of these duplicated registers may be included in an acceleratorintegration slice 1890. Exemplary registers that may be initialized by ahypervisor are shown in Table 1.

TABLE 1 Hypervisor Initialized Registers 1 Slice Control Register 2 RealAddress (RA) Scheduled Processes Area Pointer 3 Authority Mask OverrideRegister 4 Interrupt Vector Table Entry Offset 5 Interrupt Vector TableEntry Limit 6 State Register 7 Logical Partition ID 8 Real address (RA)Hypervisor Accelerator Utilization Record Pointer 9 Storage DescriptionRegister

Exemplary registers that may be initialized by an operating system areshown in Table 2.

TABLE 2 Operating System Initialized Registers 1 Process and ThreadIdentification 2 Effective Address (EA) Context Save/Restore Pointer 3Virtual Address (VA) Accelerator Utilization Record Pointer 4 VirtualAddress (VA) Storage Segment Table Pointer 5 Authority Mask 6 Workdescriptor

In one embodiment, each WD 1884 is specific to a particular graphicsacceleration module 1846 and/or graphics processing engines 1831-1832,N. It contains all information required by a graphics processing engine1831-1832, N to do work or it can be a pointer to a memory locationwhere an application has set up a command queue of work to be completed.

FIG. 18E illustrates additional details for one exemplary embodiment ofa shared model. This embodiment includes a hypervisor real address space1898 in which a process element list 1899 is stored. Hypervisor realaddress space 1898 is accessible via a hypervisor 1896 which virtualizesgraphics acceleration module engines for operating system 1895.

In at least one embodiment, shared programming models allow for all or asubset of processes from all or a subset of partitions in a system touse a graphics acceleration module 1846. There are two programmingmodels where graphics acceleration module 1846 is shared by multipleprocesses and partitions: time-sliced shared and graphics directedshared.

In this model, system hypervisor 1896 owns graphics acceleration module1846 and makes its function available to all operating systems 1895. Fora graphics acceleration module 1846 to support virtualization by systemhypervisor 1896, graphics acceleration module 1846 may adhere tofollowing: 1) An application's job request must be autonomous (that is,state does not need to be maintained between jobs), or graphicsacceleration module 1846 must provide a context save and restoremechanism. 2) An application's job request is guaranteed by graphicsacceleration module 1846 to complete in a specified amount of time,including any translation faults, or graphics acceleration module 1846provides an ability to preempt processing of a job. 3) Graphicsacceleration module 1846 must be guaranteed fairness between processeswhen operating in a directed shared programming model.

In at least one embodiment, application 1880 is required to make anoperating system 1895 system call with a graphics acceleration module1846 type, a work descriptor (WD), an authority mask register (AMR)value, and a context save/restore area pointer (CSRP). In at least oneembodiment, graphics acceleration module 1846 type describes a targetedacceleration function for a system call. In at least one embodiment,graphics acceleration module 1846 type may be a system-specific value.In at least one embodiment, WD is formatted specifically for graphicsacceleration module 1846 and can be in a form of a graphics accelerationmodule 1846 command, an effective address pointer to a user-definedstructure, an effective address pointer to a queue of commands, or anyother data structure to describe work to be done by graphicsacceleration module 1846. In one embodiment, an AMR value is an AMRstate to use for a current process. In at least one embodiment, a valuepassed to an operating system is similar to an application setting anAMR. If accelerator integration circuit 1836 and graphics accelerationmodule 1846 implementations do not support a User Authority MaskOverride Register (UAMOR), an operating system may apply a current UAMORvalue to an AMR value before passing an AMR in a hypervisor call.Hypervisor 1896 may optionally apply a current Authority Mask OverrideRegister (AMOR) value before placing an AMR into process element 1883.In at least one embodiment, CSRP is one of registers 1845 containing aneffective address of an area in an application's address space 1882 forgraphics acceleration module 1846 to save and restore context state.This pointer is optional if no state is required to be saved betweenjobs or when a job is preempted. In at least one embodiment, contextsave/restore area may be pinned system memory.

Upon receiving a system call, operating system 1895 may verify thatapplication 1880 has registered and been given authority to use graphicsacceleration module 1846. Operating system 1895 then calls hypervisor1896 with information shown in Table 3.

TABLE 3 OS to Hypervisor Call Parameters 1 A work descriptor (WD) 2 AnAuthority Mask Register (AMR) value (potentially masked) 3 An effectiveaddress (EA) Context Save/Restore Area Pointer (CSRP) 4 A process ID(PID) and optional thread ID (TID) 5 A virtual address (VA) acceleratorutilization record pointer (AURP) 6 Virtual address of storage segmenttable pointer (SSTP) 7 A logical interrupt service number (LISN)

Upon receiving a hypervisor call, hypervisor 1896 verifies thatoperating system 1895 has registered and been given authority to usegraphics acceleration module 1846. Hypervisor 1896 then puts processelement 1883 into a process element linked list for a correspondinggraphics acceleration module 1846 type. A process element may includeinformation shown in Table 4.

TABLE 4 Process Element Information 1 A work descriptor (WD) 2 AnAuthority Mask Register (AMR) value (potentially masked). 3 An effectiveaddress (EA) Context Save/Restore Area Pointer (CSRP) 4 A process ID(PID) and optional thread ID (TID) 5 A virtual address (VA) acceleratorutilization record pointer (AURP) 6 Virtual address of storage segmenttable pointer (SSTP) 7 A logical interrupt service number (LISN) 8Interrupt vector table, derived from hypervisor call parameters 9 Astate register (SR) value 10 A logical partition ID (LPID) 11 A realaddress (RA) hypervisor accelerator utilization record pointer 12Storage Descriptor Register (SDR)

In at least one embodiment, hypervisor initializes a plurality ofaccelerator integration slice 1890 registers 1845.

As illustrated in FIG. 18F, in at least one embodiment, a unified memoryis used, addressable via a common virtual memory address space used toaccess physical processor memories 1801-1802 and GPU memories 1820-1823.In this implementation, operations executed on GPUs 1810-1813 utilize asame virtual/effective memory address space to access processor memories1801-1802 and vice versa, thereby simplifying programmability. In oneembodiment, a first portion of a virtual/effective address space isallocated to processor memory 1801, a second portion to second processormemory 1802, a third portion to GPU memory 1820, and so on. In at leastone embodiment, an entire virtual/effective memory space (sometimesreferred to as an effective address space) is thereby distributed acrosseach of processor memories 1801-1802 and GPU memories 1820-1823,allowing any processor or GPU to access any physical memory with avirtual address mapped to that memory.

In one embodiment, bias/coherence management circuitry 1894A-1894Ewithin one or more of MMUs 1839A-1839E ensures cache coherence betweencaches of one or more host processors (e.g., 1805) and GPUs 1810-1813and implements biasing techniques indicating physical memories in whichcertain types of data should be stored. While multiple instances ofbias/coherence management circuitry 1894A-1894E are illustrated in FIG.18F, bias/coherence circuitry may be implemented within an MMU of one ormore host processors 1805 and/or within accelerator integration circuit1836.

One embodiment allows GPU-attached memory 1820-1823 to be mapped as partof system memory, and accessed using shared virtual memory (SVM)technology, but without suffering performance drawbacks associated withfull system cache coherence. In at least one embodiment, an ability forGPU-attached memory 1820-1823 to be accessed as system memory withoutonerous cache coherence overhead provides a beneficial operatingenvironment for GPU offload. This arrangement allows host processor 1805software to setup operands and access computation results, withoutoverhead of tradition I/O DMA data copies. Such traditional copiesinvolve driver calls, interrupts and memory mapped I/O (MMIO) accessesthat are all inefficient relative to simple memory accesses. In at leastone embodiment, an ability to access GPU attached memory 1820-1823without cache coherence overheads can be critical to execution time ofan offloaded computation. In cases with substantial streaming writememory traffic, for example, cache coherence overhead can significantlyreduce an effective write bandwidth seen by a GPU 1810-1813. In at leastone embodiment, efficiency of operand setup, efficiency of resultsaccess, and efficiency of GPU computation may play a role in determiningeffectiveness of a GPU offload.

In at least one embodiment, selection of GPU bias and host processorbias is driven by a bias tracker data structure. A bias table may beused, for example, which may be a page-granular structure (i.e.,controlled at a granularity of a memory page) that includes 1 or 2 bitsper GPU-attached memory page. In at least one embodiment, a bias tablemay be implemented in a stolen memory range of one or more GPU-attachedmemories 1820-1823, with or without a bias cache in GPU 1810-1813 (e.g.,to cache frequently/recently used entries of a bias table).Alternatively, an entire bias table may be maintained within a GPU.

In at least one embodiment, a bias table entry associated with eachaccess to GPU-attached memory 1820-1823 is accessed prior to actualaccess to a GPU memory, causing following operations. First, localrequests from GPU 1810-1813 that find their page in GPU bias areforwarded directly to a corresponding GPU memory 1820-1823. Localrequests from a GPU that find their page in host bias are forwarded toprocessor 1805 (e.g., over a high-speed link as discussed above). In oneembodiment, requests from processor 1805 that find a requested page inhost processor bias complete a request like a normal memory read.Alternatively, requests directed to a GPU-biased page may be forwardedto GPU 1810-1813. In at least one embodiment, a GPU may then transitiona page to a host processor bias if it is not currently using a page. Inat least one embodiment, bias state of a page can be changed either by asoftware-based mechanism, a hardware-assisted software-based mechanism,or, for a limited set of cases, a purely hardware-based mechanism.

One mechanism for changing bias state employs an API call (e.g.,OpenCL), which, in turn, calls a GPU's device driver which, in turn,sends a message (or enqueues a command descriptor) to a GPU directing itto change a bias state and, for some transitions, perform a cacheflushing operation in a host. In at least one embodiment, cache flushingoperation is used for a transition from host processor 1805 bias to GPUbias, but is not for an opposite transition.

In one embodiment, cache coherency is maintained by temporarilyrendering GPU-biased pages uncacheable by host processor 1805. To accessthese pages, processor 1805 may request access from GPU 1810 which mayor may not grant access right away. Thus, to reduce communicationbetween processor 1805 and GPU 1810 it is beneficial to ensure thatGPU-biased pages are those which are required by a GPU but not hostprocessor 1805 and vice versa.

Hardware structure(s) 1015 are used to perform one or more embodiments.Details regarding hardware structure(x) 1015 are provided herein inconjunction with FIGS. 10A and/or 10B.

FIG. 19 illustrates exemplary integrated circuits and associatedgraphics processors that may be fabricated using one or more IP cores,according to various embodiments described herein. In addition to whatis illustrated, other logic and circuits may be included in at least oneembodiment, including additional graphics processors/cores, peripheralinterface controllers, or general-purpose processor cores.

FIG. 19 is a block diagram illustrating an exemplary system on a chipintegrated circuit 1900 that may be fabricated using one or more IPcores, according to at least one embodiment. In at least one embodiment,integrated circuit 1900 includes one or more application processor(s)1905 (e.g., CPUs), at least one graphics processor 1910, and mayadditionally include an image processor 1915 and/or a video processor1920, any of which may be a modular IP core. In at least one embodiment,integrated circuit 1900 includes peripheral or bus logic including a USBcontroller 1925, UART controller 1930, an SPI/SDIO controller 1935, andan I.sup.2S/I.sup.2C controller 1940. In at least one embodiment,integrated circuit 1900 can include a display device 1945 coupled to oneor more of a high-definition multimedia interface (HDMI) controller 1950and a mobile industry processor interface (MIPI) display interface 1955.In at least one embodiment, storage may be provided by a flash memorysubsystem 1960 including flash memory and a flash memory controller. Inat least one embodiment, memory interface may be provided via a memorycontroller 1965 for access to SDRAM or SRAM memory devices. In at leastone embodiment, some integrated circuits additionally include anembedded security engine 1970.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used inintegrated circuit 1900 for inferencing or predicting operations based,at least in part, on weight parameters calculated using neural networktraining operations, neural network functions and/or architectures, orneural network use cases described herein.

FIGS. 20A-20B illustrate exemplary integrated circuits and associatedgraphics processors that may be fabricated using one or more IP cores,according to various embodiments described herein. In addition to whatis illustrated, other logic and circuits may be included in at least oneembodiment, including additional graphics processors/cores, peripheralinterface controllers, or general-purpose processor cores.

FIGS. 20A-20B are block diagrams illustrating exemplary graphicsprocessors for use within an SoC, according to embodiments describedherein. FIG. 20A illustrates an exemplary graphics processor 2010 of asystem on a chip integrated circuit that may be fabricated using one ormore IP cores, according to at least one embodiment. FIG. 20Billustrates an additional exemplary graphics processor 2040 of a systemon a chip integrated circuit that may be fabricated using one or more IPcores, according to at least one embodiment. In at least one embodiment,graphics processor 2010 of FIG. 20A is a low power graphics processorcore. In at least one embodiment, graphics processor 2040 of FIG. 20B isa higher performance graphics processor core. In at least oneembodiment, each of graphics processors 2010, 2040 can be variants ofgraphics processor 1910 of FIG. 19.

In at least one embodiment, graphics processor 2010 includes a vertexprocessor 2005 and one or more fragment processor(s) 2015A-2015N (e.g.,2015A, 2015B, 2015C, 2015D, through 2015N-1, and 2015N). In at least oneembodiment, graphics processor 2010 can execute different shaderprograms via separate logic, such that vertex processor 2005 isoptimized to execute operations for vertex shader programs, while one ormore fragment processor(s) 2015A-2015N execute fragment (e.g., pixel)shading operations for fragment or pixel shader programs. In at leastone embodiment, vertex processor 2005 performs a vertex processing stageof a 3D graphics pipeline and generates primitives and vertex data. Inat least one embodiment, fragment processor(s) 2015A-2015N use primitiveand vertex data generated by vertex processor 2005 to produce aframebuffer that is displayed on a display device. In at least oneembodiment, fragment processor(s) 2015A-2015N are optimized to executefragment shader programs as provided for in an OpenGL API, which may beused to perform similar operations as a pixel shader program as providedfor in a Direct 3D API.

In at least one embodiment, graphics processor 2010 additionallyincludes one or more memory management units (MMUs) 2020A-2020B,cache(s) 2025A-2025B, and circuit interconnect(s) 2030A-2030B. In atleast one embodiment, one or more MMU(s) 2020A-2020B provide for virtualto physical address mapping for graphics processor 2010, including forvertex processor 2005 and/or fragment processor(s) 2015A-2015N, whichmay reference vertex or image/texture data stored in memory, in additionto vertex or image/texture data stored in one or more cache(s)2025A-2025B. In at least one embodiment, one or more MMU(s) 2020A-2020Bmay be synchronized with other MMUs within system, including one or moreMMUs associated with one or more application processor(s) 1905, imageprocessors 1915, and/or video processors 1920 of FIG. 19, such that eachprocessor 1905-1920 can participate in a shared or unified virtualmemory system. In at least one embodiment, one or more circuitinterconnect(s) 2030A-2030B enable graphics processor 2010 to interfacewith other IP cores within SoC, either via an internal bus of SoC or viaa direct connection.

In at least one embodiment, graphics processor 2040 includes one or moreMMU(s) 2020A-2020B, caches 2025A-2025B, and circuit interconnects2030A-2030B of graphics processor 2010 of FIG. 20A. In at least oneembodiment, graphics processor 2040 includes one or more shader core(s)2055A-2055N (e.g., 2055A, 2055B, 2055C, 2055D, 2055E, 2055F, through2055N-1, and 2055N), which provides for a unified shader corearchitecture in which a single core or type or core can execute alltypes of programmable shader code, including shader program code toimplement vertex shaders, fragment shaders, and/or compute shaders. Inat least one embodiment, a number of shader cores can vary. In at leastone embodiment, graphics processor 2040 includes an inter-core taskmanager 2045, which acts as a thread dispatcher to dispatch executionthreads to one or more shader cores 2055A-2055N and a tiling unit 2058to accelerate tiling operations for tile-based rendering, in whichrendering operations for a scene are subdivided in image space, forexample to exploit local spatial coherence within a scene or to optimizeuse of internal caches.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used inintegrated circuit 20A and/or 20B for inferencing or predictingoperations based, at least in part, on weight parameters calculatedusing neural network training operations, neural network functionsand/or architectures, or neural network use cases described herein.

FIGS. 21A-21B illustrate additional exemplary graphics processor logicaccording to embodiments described herein. FIG. 21A illustrates agraphics core 2100 that may be included within graphics processor 1910of FIG. 19, in at least one embodiment, and may be a unified shader core2055A-2055N as in FIG. 20B in at least one embodiment. FIG. 21Billustrates a highly-parallel general-purpose graphics processing unit2130 suitable for deployment on a multi-chip module in at least oneembodiment.

In at least one embodiment, graphics core 2100 includes a sharedinstruction cache 2102, a texture unit 2118, and a cache/shared memory2120 that are common to execution resources within graphics core 2100.In at least one embodiment, graphics core 2100 can include multipleslices 2101A-2101N or partition for each core, and a graphics processorcan include multiple instances of graphics core 2100. Slices 2101A-2101Ncan include support logic including a local instruction cache2104A-2104N, a thread scheduler 2106A-2106N, a thread dispatcher2108A-2108N, and a set of registers 2110A-2110N. In at least oneembodiment, slices 2101A-2101N can include a set of additional functionunits (AFUs 2112A-2112N), floating-point units (FPU 2114A-2114N),integer arithmetic logic units (ALUs 2116-2116N), address computationalunits (ACU 2113A-2113N), double-precision floating-point units (DPFPU2115A-2115N), and matrix processing units (MPU 2117A-2117N).

In at least one embodiment, FPUs 2114A-2114N can performsingle-precision (32-bit) and half-precision (16-bit) floating pointoperations, while DPFPUs 2115A-2115N perform double precision (64-bit)floating point operations. In at least one embodiment, ALUs 2116A-2116Ncan perform variable precision integer operations at 8-bit, 16-bit, and32-bit precision, and can be configured for mixed precision operations.In at least one embodiment, MPUs 2117A-2117N can also be configured formixed precision matrix operations, including half-precision floatingpoint and 8-bit integer operations. In at least one embodiment, MPUs2117-2117N can perform a variety of matrix operations to acceleratemachine learning application frameworks, including enabling support foraccelerated general matrix to matrix multiplication (GEMM). In at leastone embodiment, AFUs 2112A-2112N can perform additional logic operationsnot supported by floating-point or integer units, includingtrigonometric operations (e.g., Sine, Cosine, etc.).

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in graphicscore 2100 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 21B illustrates a general-purpose processing unit (GPGPU) 2130 thatcan be configured to enable highly-parallel compute operations to beperformed by an array of graphics processing units, in at least oneembodiment. In at least one embodiment, GPGPU 2130 can be linkeddirectly to other instances of GPGPU 2130 to create a multi-GPU clusterto improve training speed for deep neural networks. In at least oneembodiment, GPGPU 2130 includes a host interface 2132 to enable aconnection with a host processor. In at least one embodiment, hostinterface 2132 is a PCI Express interface. In at least one embodiment,host interface 2132 can be a vendor specific communications interface orcommunications fabric. In at least one embodiment, GPGPU 2130 receivescommands from a host processor and uses a global scheduler 2134 todistribute execution threads associated with those commands to a set ofcompute clusters 2136A-2136H. In at least one embodiment, computeclusters 2136A-2136H share a cache memory 2138. In at least oneembodiment, cache memory 2138 can serve as a higher-level cache forcache memories within compute clusters 2136A-2136H.

In at least one embodiment, GPGPU 2130 includes memory 2144A-2144Bcoupled with compute clusters 2136A-2136H via a set of memorycontrollers 2142A-2142B. In at least one embodiment, memory 2144A-2144Bcan include various types of memory devices including dynamic randomaccess memory (DRAM) or graphics random access memory, such assynchronous graphics random access memory (SGRAM), including graphicsdouble data rate (GDDR) memory.

In at least one embodiment, compute clusters 2136A-2136H each include aset of graphics cores, such as graphics core 2100 of FIG. 21A, which caninclude multiple types of integer and floating point logic units thatcan perform computational operations at a range of precisions includingsuited for machine learning computations. For example, in at least oneembodiment, at least a subset of floating point units in each of computeclusters 2136A-2136H can be configured to perform 16-bit or 32-bitfloating point operations, while a different subset of floating pointunits can be configured to perform 64-bit floating point operations.

In at least one embodiment, multiple instances of GPGPU 2130 can beconfigured to operate as a compute cluster. In at least one embodiment,communication used by compute clusters 2136A-2136H for synchronizationand data exchange varies across embodiments. In at least one embodiment,multiple instances of GPGPU 2130 communicate over host interface 2132.In at least one embodiment, GPGPU 2130 includes an I/O hub 2139 thatcouples GPGPU 2130 with a GPU link 2140 that enables a direct connectionto other instances of GPGPU 2130. In at least one embodiment, GPU link2140 is coupled to a dedicated GPU-to-GPU bridge that enablescommunication and synchronization between multiple instances of GPGPU2130. In at least one embodiment GPU link 2140 couples with a high speedinterconnect to transmit and receive data to other GPGPUs or parallelprocessors. In at least one embodiment, multiple instances of GPGPU 2130are located in separate data processing systems and communicate via anetwork device that is accessible via host interface 2132. In at leastone embodiment GPU link 2140 can be configured to enable a connection toa host processor in addition to or as an alternative to host interface2132.

In at least one embodiment, GPGPU 2130 can be configured to train neuralnetworks. In at least one embodiment, GPGPU 2130 can be used within aninferencing platform. In at least one embodiment, in which GPGPU 2130 isused for inferencing, GPGPU may include fewer compute clusters2136A-2136H relative to when GPGPU is used for training a neuralnetwork. In at least one embodiment, memory technology associated withmemory 2144A-2144B may differ between inferencing and trainingconfigurations, with higher bandwidth memory technologies devoted totraining configurations. In at least one embodiment, inferencingconfiguration of GPGPU 2130 can support inferencing specificinstructions. For example, in at least one embodiment, an inferencingconfiguration can provide support for one or more 8-bit integer dotproduct instructions, which may be used during inferencing operationsfor deployed neural networks.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in GPGPU2130 for inferencing or predicting operations based, at least in part,on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 22 is a block diagram illustrating a computing system 2200according to at least one embodiment. In at least one embodiment,computing system 2200 includes a processing subsystem 2201 having one ormore processor(s) 2202 and a system memory 2204 communicating via aninterconnection path that may include a memory hub 2205. In at least oneembodiment, memory hub 2205 may be a separate component within a chipsetcomponent or may be integrated within one or more processor(s) 2202. Inat least one embodiment, memory hub 2205 couples with an I/O subsystem2211 via a communication link 2206. In at least one embodiment, I/Osubsystem 2211 includes an I/O hub 2207 that can enable computing system2200 to receive input from one or more input device(s) 2208. In at leastone embodiment, I/O hub 2207 can enable a display controller, which maybe included in one or more processor(s) 2202, to provide outputs to oneor more display device(s) 2210A. In at least one embodiment, one or moredisplay device(s) 2210A coupled with I/O hub 2207 can include a local,internal, or embedded display device.

In at least one embodiment, processing subsystem 2201 includes one ormore parallel processor(s) 2212 coupled to memory hub 2205 via a bus orother communication link 2213. In at least one embodiment, communicationlink 2213 may be one of any number of standards based communication linktechnologies or protocols, such as, but not limited to PCI Express, ormay be a vendor specific communications interface or communicationsfabric. In at least one embodiment, one or more parallel processor(s)2212 form a computationally focused parallel or vector processing systemthat can include a large number of processing cores and/or processingclusters, such as a many integrated core (MIC) processor. In at leastone embodiment, one or more parallel processor(s) 2212 form a graphicsprocessing subsystem that can output pixels to one of one or moredisplay device(s) 2210A coupled via I/O Hub 2207. In at least oneembodiment, one or more parallel processor(s) 2212 can also include adisplay controller and display interface (not shown) to enable a directconnection to one or more display device(s) 2210B.

In at least one embodiment, a system storage unit 2214 can connect toI/O hub 2207 to provide a storage mechanism for computing system 2200.In at least one embodiment, an I/O switch 2216 can be used to provide aninterface mechanism to enable connections between I/O hub 2207 and othercomponents, such as a network adapter 2218 and/or wireless networkadapter 2219 that may be integrated into platform, and various otherdevices that can be added via one or more add-in device(s) 2220. In atleast one embodiment, network adapter 2218 can be an Ethernet adapter oranother wired network adapter. In at least one embodiment, wirelessnetwork adapter 2219 can include one or more of a Wi-Fi, Bluetooth, nearfield communication (NFC), or other network device that includes one ormore wireless radios.

In at least one embodiment, computing system 2200 can include othercomponents not explicitly shown, including USB or other portconnections, optical storage drives, video capture devices, may also beconnected to I/O hub 2207. In at least one embodiment, communicationpaths interconnecting various components in FIG. 22 may be implementedusing any suitable protocols, such as PCI (Peripheral ComponentInterconnect) based protocols (e.g., PCI-Express), or other bus orpoint-to-point communication interfaces and/or protocol(s), such asNV-Link high-speed interconnect, or interconnect protocols.

In at least one embodiment, one or more parallel processor(s) 2212incorporate circuitry optimized for graphics and video processing,including, for example, video output circuitry, and constitutes agraphics processing unit (GPU). In at least one embodiment, one or moreparallel processor(s) 2212 incorporate circuitry optimized for generalpurpose processing. In at least embodiment, components of computingsystem 2200 may be integrated with one or more other system elements ona single integrated circuit. For example, in at least one embodiment,one or more parallel processor(s) 2212, memory hub 2205, processor(s)2202, and I/O hub 2207 can be integrated into a system on chip (SoC)integrated circuit. In at least one embodiment, components of computingsystem 2200 can be integrated into a single package to form a system inpackage (SIP) configuration. In at least one embodiment, at least aportion of components of computing system 2200 can be integrated into amulti-chip module (MCM), which can be interconnected with othermulti-chip modules into a modular computing system.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in systemFIG. 2200 for inferencing or predicting operations based, at least inpart, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

Processors

FIG. 23A illustrates a parallel processor 2300 according to at least onembodiment. In at least one embodiment, various components of parallelprocessor 2300 may be implemented using one or more integrated circuitdevices, such as programmable processors, application specificintegrated circuits (ASICs), or field programmable gate arrays (FPGA).In at least one embodiment, illustrated parallel processor 2300 is avariant of one or more parallel processor(s) 2212 shown in FIG. 22according to an exemplary embodiment.

In at least one embodiment, parallel processor 2300 includes a parallelprocessing unit 2302. In at least one embodiment, parallel processingunit 2302 includes an I/O unit 2304 that enables communication withother devices, including other instances of parallel processing unit2302. In at least one embodiment, I/O unit 2304 may be directlyconnected to other devices. In at least one embodiment, I/O unit 2304connects with other devices via use of a hub or switch interface, suchas memory hub 2205. In at least one embodiment, connections betweenmemory hub 2205 and I/O unit 2304 form a communication link 2213. In atleast one embodiment, I/O unit 2304 connects with a host interface 2306and a memory crossbar 2316, where host interface 2306 receives commandsdirected to performing processing operations and memory crossbar 2316receives commands directed to performing memory operations.

In at least one embodiment, when host interface 2306 receives a commandbuffer via I/O unit 2304, host interface 2306 can direct work operationsto perform those commands to a front end 2308. In at least oneembodiment, front end 2308 couples with a scheduler 2310, which isconfigured to distribute commands or other work items to a processingcluster array 2312. In at least one embodiment, scheduler 2310 ensuresthat processing cluster array 2312 is properly configured and in a validstate before tasks are distributed to processing cluster array 2312 ofprocessing cluster array 2312. In at least one embodiment, scheduler2310 is implemented via firmware logic executing on a microcontroller.In at least one embodiment, microcontroller implemented scheduler 2310is configurable to perform complex scheduling and work distributionoperations at coarse and fine granularity, enabling rapid preemption andcontext switching of threads executing on processing array 2312. In atleast one embodiment, host software can prove workloads for schedulingon processing array 2312 via one of multiple graphics processingdoorbells. In at least one embodiment, workloads can then beautomatically distributed across processing array 2312 by scheduler 2310logic within a microcontroller including scheduler 2310.

In at least one embodiment, processing cluster array 2312 can include upto “N” processing clusters (e.g., cluster 2314A, cluster 2314B, throughcluster 2314N). In at least one embodiment, each cluster 2314A-2314N ofprocessing cluster array 2312 can execute a large number of concurrentthreads. In at least one embodiment, scheduler 2310 can allocate work toclusters 2314A-2314N of processing cluster array 2312 using variousscheduling and/or work distribution algorithms, which may vary dependingon workload arising for each type of program or computation. In at leastone embodiment, scheduling can be handled dynamically by scheduler 2310,or can be assisted in part by compiler logic during compilation ofprogram logic configured for execution by processing cluster array 2312.In at least one embodiment, different clusters 2314A-2314N of processingcluster array 2312 can be allocated for processing different types ofprograms or for performing different types of computations.

In at least one embodiment, processing cluster array 2312 can beconfigured to perform various types of parallel processing operations.In at least one embodiment, processing cluster array 2312 is configuredto perform general-purpose parallel compute operations. For example, inat least one embodiment, processing cluster array 2312 can include logicto execute processing tasks including filtering of video and/or audiodata, performing modeling operations, including physics operations, andperforming data transformations.

In at least one embodiment, processing cluster array 2312 is configuredto perform parallel graphics processing operations. In at least oneembodiment, processing cluster array 2312 can include additional logicto support execution of such graphics processing operations, including,but not limited to texture sampling logic to perform texture operations,as well as tessellation logic and other vertex processing logic. In atleast one embodiment, processing cluster array 2312 can be configured toexecute graphics processing related shader programs such as, but notlimited to vertex shaders, tessellation shaders, geometry shaders, andpixel shaders. In at least one embodiment, parallel processing unit 2302can transfer data from system memory via I/O unit 2304 for processing.In at least one embodiment, during processing, transferred data can bestored to on-chip memory (e.g., parallel processor memory 2322) duringprocessing, then written back to system memory.

In at least one embodiment, when parallel processing unit 2302 is usedto perform graphics processing, scheduler 2310 can be configured todivide a processing workload into approximately equal sized tasks, tobetter enable distribution of graphics processing operations to multipleclusters 2314A-2314N of processing cluster array 2312. In at least oneembodiment, portions of processing cluster array 2312 can be configuredto perform different types of processing. For example, in at least oneembodiment, a first portion may be configured to perform vertex shadingand topology generation, a second portion may be configured to performtessellation and geometry shading, and a third portion may be configuredto perform pixel shading or other screen space operations, to produce arendered image for display. In at least one embodiment, intermediatedata produced by one or more of clusters 2314A-2314N may be stored inbuffers to allow intermediate data to be transmitted between clusters2314A-2314N for further processing.

In at least one embodiment, processing cluster array 2312 can receiveprocessing tasks to be executed via scheduler 2310, which receivescommands defining processing tasks from front end 2308. In at least oneembodiment, processing tasks can include indices of data to beprocessed, e.g., surface (patch) data, primitive data, vertex data,and/or pixel data, as well as state parameters and commands defining howdata is to be processed (e.g., what program is to be executed). In atleast one embodiment, scheduler 2310 may be configured to fetch indicescorresponding to tasks or may receive indices from front end 2308. In atleast one embodiment, front end 2308 can be configured to ensureprocessing cluster array 2312 is configured to a valid state before aworkload specified by incoming command buffers (e.g., batch-buffers,push buffers, etc.) is initiated.

In at least one embodiment, each of one or more instances of parallelprocessing unit 2302 can couple with parallel processor memory 2322. Inat least one embodiment, parallel processor memory 2322 can be accessedvia memory crossbar 2316, which can receive memory requests fromprocessing cluster array 2312 as well as I/O unit 2304. In at least oneembodiment, memory crossbar 2316 can access parallel processor memory2322 via a memory interface 2318. In at least one embodiment, memoryinterface 2318 can include multiple partition units (e.g., partitionunit 2320A, partition unit 2320B, through partition unit 2320N) that caneach couple to a portion (e.g., memory unit) of parallel processormemory 2322. In at least one embodiment, a number of partition units2320A-2320N is configured to be equal to a number of memory units, suchthat a first partition unit 2320A has a corresponding first memory unit2324A, a second partition unit 2320B has a corresponding memory unit2324B, and an Nth partition unit 2320N has a corresponding Nth memoryunit 2324N. In at least one embodiment, a number of partition units2320A-2320N may not be equal to a number of memory devices.

In at least one embodiment, memory units 2324A-2324N can include varioustypes of memory devices, including dynamic random access memory (DRAM)or graphics random access memory, such as synchronous graphics randomaccess memory (SGRAM), including graphics double data rate (GDDR)memory. In at least one embodiment, memory units 2324A-2324N may alsoinclude 3D stacked memory, including but not limited to high bandwidthmemory (HBM). In at least one embodiment, render targets, such as framebuffers or texture maps may be stored across memory units 2324A-2324N,allowing partition units 2320A-2320N to write portions of each rendertarget in parallel to efficiently use available bandwidth of parallelprocessor memory 2322. In at least one embodiment, a local instance ofparallel processor memory 2322 may be excluded in favor of a unifiedmemory design that utilizes system memory in conjunction with localcache memory.

In at least one embodiment, any one of clusters 2314A-2314N ofprocessing cluster array 2312 can process data that will be written toany of memory units 2324A-2324N within parallel processor memory 2322.In at least one embodiment, memory crossbar 2316 can be configured totransfer an output of each cluster 2314A-2314N to any partition unit2320A-2320N or to another cluster 2314A-2314N, which can performadditional processing operations on an output. In at least oneembodiment, each cluster 2314A-2314N can communicate with memoryinterface 2318 through memory crossbar 2316 to read from or write tovarious external memory devices. In at least one embodiment, memorycrossbar 2316 has a connection to memory interface 2318 to communicatewith I/O unit 2304, as well as a connection to a local instance ofparallel processor memory 2322, enabling processing units withindifferent processing clusters 2314A-2314N to communicate with systemmemory or other memory that is not local to parallel processing unit2302. In at least one embodiment, memory crossbar 2316 can use virtualchannels to separate traffic streams between clusters 2314A-2314N andpartition units 2320A-2320N.

In at least one embodiment, multiple instances of parallel processingunit 2302 can be provided on a single add-in card, or multiple add-incards can be interconnected. In at least one embodiment, differentinstances of parallel processing unit 2302 can be configured tointer-operate even if different instances have different numbers ofprocessing cores, different amounts of local parallel processor memory,and/or other configuration differences. For example, in at least oneembodiment, some instances of parallel processing unit 2302 can includehigher precision floating point units relative to other instances. In atleast one embodiment, systems incorporating one or more instances ofparallel processing unit 2302 or parallel processor 2300 can beimplemented in a variety of configurations and form factors, includingbut not limited to desktop, laptop, or handheld personal computers,servers, workstations, game consoles, and/or embedded systems.

FIG. 23B is a block diagram of a partition unit 2320 according to atleast one embodiment. In at least one embodiment, partition unit 2320 isan instance of one of partition units 2320A-2320N of FIG. 23A. In atleast one embodiment, partition unit 2320 includes an L2 cache 2321, aframe buffer interface 2325, and a ROP 2326 (raster operations unit). L2cache 2321 is a read/write cache that is configured to perform load andstore operations received from memory crossbar 2316 and ROP 2326. In atleast one embodiment, read misses and urgent write-back requests areoutput by L2 cache 2321 to frame buffer interface 2325 for processing.In at least one embodiment, updates can also be sent to a frame buffervia frame buffer interface 2325 for processing. In at least oneembodiment, frame buffer interface 2325 interfaces with one of memoryunits in parallel processor memory, such as memory units 2324A-2324N ofFIG. 23 (e.g., within parallel processor memory 2322).

In at least one embodiment, ROP 2326 is a processing unit that performsraster operations such as stencil, z test, and blending. In at least oneembodiment, ROP 2326 then outputs processed graphics data that is storedin graphics memory. In at least one embodiment, ROP 2326 includescompression logic to compress depth or color data that is written tomemory and decompress depth or color data that is read from memory. Inat least one embodiment, compression logic can be lossless compressionlogic that makes use of one or more of multiple compression algorithms.Type of compression that is performed by ROP 2326 can vary based onstatistical characteristics of data to be compressed. For example, in atleast one embodiment, delta color compression is performed on depth andcolor data on a per-tile basis.

In at least one embodiment, ROP 2326 is included within each processingcluster (e.g., cluster 2314A-2314N of FIG. 23) instead of withinpartition unit 2320. In at least one embodiment, read and write requestsfor pixel data are transmitted over memory crossbar 2316 instead ofpixel fragment data. In at least one embodiment, processed graphics datamay be displayed on a display device, such as one of one or more displaydevice(s) 2210 of FIG. 22, routed for further processing by processor(s)2202, or routed for further processing by one of processing entitieswithin parallel processor 2300 of FIG. 23A.

FIG. 23C is a block diagram of a processing cluster 2314 within aparallel processing unit according to at least one embodiment. In atleast one embodiment, a processing cluster is an instance of one ofprocessing clusters 2314A-2314N of FIG. 23. In at least one embodiment,processing cluster 2314 can be configured to execute many threads inparallel, where term “thread” refers to an instance of a particularprogram executing on a particular set of input data. In at least oneembodiment, single-instruction, multiple-data (SIMD) instruction issuetechniques are used to support parallel execution of a large number ofthreads without providing multiple independent instruction units. In atleast one embodiment, single-instruction, multiple-thread (SIMT)techniques are used to support parallel execution of a large number ofgenerally synchronized threads, using a common instruction unitconfigured to issue instructions to a set of processing engines withineach one of processing clusters.

In at least one embodiment, operation of processing cluster 2314 can becontrolled via a pipeline manager 2332 that distributes processing tasksto SIMT parallel processors. In at least one embodiment, pipelinemanager 2332 receives instructions from scheduler 2310 of FIG. 23 andmanages execution of those instructions via a graphics multiprocessor2334 and/or a texture unit 2336. In at least one embodiment, graphicsmultiprocessor 2334 is an exemplary instance of a SIMT parallelprocessor. However, in at least one embodiment, various types of SIMTparallel processors of differing architectures may be included withinprocessing cluster 2314. In at least one embodiment, one or moreinstances of graphics multiprocessor 2334 can be included within aprocessing cluster 2314. In at least one embodiment, graphicsmultiprocessor 2334 can process data and a data crossbar 2340 can beused to distribute processed data to one of multiple possibledestinations, including other shader units. In at least one embodiment,pipeline manager 2332 can facilitate distribution of processed data byspecifying destinations for processed data to be distributed via datacrossbar 2340.

In at least one embodiment, each graphics multiprocessor 2334 withinprocessing cluster 2314 can include an identical set of functionalexecution logic (e.g., arithmetic logic units, load-store units, etc.).In at least one embodiment, functional execution logic can be configuredin a pipelined manner in which new instructions can be issued beforeprevious instructions are complete. In at least one embodiment,functional execution logic supports a variety of operations includinginteger and floating point arithmetic, comparison operations, Booleanoperations, bit-shifting, and computation of various algebraicfunctions. In at least one embodiment, same functional-unit hardware canbe leveraged to perform different operations and any combination offunctional units may be present.

In at least one embodiment, instructions transmitted to processingcluster 2314 constitute a thread. In at least one embodiment, a set ofthreads executing across a set of parallel processing engines is athread group. In at least one embodiment, thread group executes aprogram on different input data. In at least one embodiment, each threadwithin a thread group can be assigned to a different processing enginewithin a graphics multiprocessor 2334. In at least one embodiment, athread group may include fewer threads than a number of processingengines within graphics multiprocessor 2334. In at least one embodiment,when a thread group includes fewer threads than a number of processingengines, one or more of processing engines may be idle during cycles inwhich that thread group is being processed. In at least one embodiment,a thread group may also include more threads than a number of processingengines within graphics multiprocessor 2334. In at least one embodiment,when a thread group includes more threads than number of processingengines within graphics multiprocessor 2334, processing can be performedover consecutive clock cycles. In at least one embodiment, multiplethread groups can be executed concurrently on a graphics multiprocessor2334.

In at least one embodiment, graphics multiprocessor 2334 includes aninternal cache memory to perform load and store operations. In at leastone embodiment, graphics multiprocessor 2334 can forego an internalcache and use a cache memory (e.g., L1 cache 2348) within processingcluster 2314. In at least one embodiment, each graphics multiprocessor2334 also has access to L2 caches within partition units (e.g.,partition units 2320A-2320N of FIG. 23) that are shared among allprocessing clusters 2314 and may be used to transfer data betweenthreads. In at least one embodiment, graphics multiprocessor 2334 mayalso access off-chip global memory, which can include one or more oflocal parallel processor memory and/or system memory. In at least oneembodiment, any memory external to parallel processing unit 2302 may beused as global memory. In at least one embodiment, processing cluster2314 includes multiple instances of graphics multiprocessor 2334 canshare common instructions and data, which may be stored in L1 cache2348.

In at least one embodiment, each processing cluster 2314 may include anMMU 2345 (memory management unit) that is configured to map virtualaddresses into physical addresses. In at least one embodiment, one ormore instances of MMU 2345 may reside within memory interface 2318 ofFIG. 23. In at least one embodiment, MMU 2345 includes a set of pagetable entries (PTEs) used to map a virtual address to a physical addressof a tile (talk more about tiling) and optionally a cache line index. Inat least one embodiment, MMU 2345 may include address translationlookaside buffers (TLB) or caches that may reside within graphicsmultiprocessor 2334 or L1 cache or processing cluster 2314. In at leastone embodiment, physical address is processed to distribute surface dataaccess locality to allow efficient request interleaving among partitionunits. In at least one embodiment, cache line index may be used todetermine whether a request for a cache line is a hit or miss.

In at least one embodiment, a processing cluster 2314 may be configuredsuch that each graphics multiprocessor 2334 is coupled to a texture unit2336 for performing texture mapping operations, e.g., determiningtexture sample positions, reading texture data, and filtering texturedata. In at least one embodiment, texture data is read from an internaltexture L1 cache (not shown) or from an L1 cache within graphicsmultiprocessor 2334 and is fetched from an L2 cache, local parallelprocessor memory, or system memory, as needed. In at least oneembodiment, each graphics multiprocessor 2334 outputs processed tasks todata crossbar 2340 to provide processed task to another processingcluster 2314 for further processing or to store processed task in an L2cache, local parallel processor memory, or system memory via memorycrossbar 2316. In at least one embodiment, preROP 2342 (pre-rasteroperations unit) is configured to receive data from graphicsmultiprocessor 2334, direct data to ROP units, which may be located withpartition units as described herein (e.g., partition units 2320A-2320Nof FIG. 23). In at least one embodiment, PreROP 2342 unit can performoptimizations for color blending, organize pixel color data, and performaddress translations.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in graphicsprocessing cluster 2314 for inferencing or predicting operations based,at least in part, on weight parameters calculated using neural networktraining operations, neural network functions and/or architectures, orneural network use cases described herein.

FIG. 23D shows a graphics multiprocessor 2334 according to at least oneembodiment. In at least one embodiment, graphics multiprocessor 2334couples with pipeline manager 2332 of processing cluster 2314. In atleast one embodiment, graphics multiprocessor 2334 has an executionpipeline including but not limited to an instruction cache 2352, aninstruction unit 2354, an address mapping unit 2356, a register file2358, one or more general purpose graphics processing unit (GPGPU) cores2362, and one or more load/store units 2366. GPGPU cores 2362 andload/store units 2366 are coupled with cache memory 2372 and sharedmemory 2370 via a memory and cache interconnect 2368.

In at least one embodiment, instruction cache 2352 receives a stream ofinstructions to execute from pipeline manager 2332. In at least oneembodiment, instructions are cached in instruction cache 2352 anddispatched for execution by instruction unit 2354. In at least oneembodiment, instruction unit 2354 can dispatch instructions as threadgroups (e.g., warps), with each thread of thread group assigned to adifferent execution unit within GPGPU core 2362. In at least oneembodiment, an instruction can access any of a local, shared, or globaladdress space by specifying an address within a unified address space.In at least one embodiment, address mapping unit 2356 can be used totranslate addresses in a unified address space into a distinct memoryaddress that can be accessed by load/store units 2366.

In at least one embodiment, register file 2358 provides a set ofregisters for functional units of graphics multiprocessor 2334. In atleast one embodiment, register file 2358 provides temporary storage foroperands connected to data paths of functional units (e.g., GPGPU cores2362, load/store units 2366) of graphics multiprocessor 2334. In atleast one embodiment, register file 2358 is divided between each offunctional units such that each functional unit is allocated a dedicatedportion of register file 2358. In at least one embodiment, register file2358 is divided between different warps being executed by graphicsmultiprocessor 2334.

In at least one embodiment, GPGPU cores 2362 can each include floatingpoint units (FPUs) and/or integer arithmetic logic units (ALUs) that areused to execute instructions of graphics multiprocessor 2334. GPGPUcores 2362 can be similar in architecture or can differ in architecture.In at least one embodiment, a first portion of GPGPU cores 2362 includea single precision FPU and an integer ALU while a second portion ofGPGPU cores include a double precision FPU. In at least one embodiment,FPUs can implement IEEE 754-2008 standard for floating point arithmeticor enable variable precision floating point arithmetic. In at least oneembodiment, graphics multiprocessor 2334 can additionally include one ormore fixed function or special function units to perform specificfunctions such as copy rectangle or pixel blending operations. In atleast one embodiment one or more of GPGPU cores can also include fixedor special function logic.

In at least one embodiment, GPGPU cores 2362 include SIMD logic capableof performing a single instruction on multiple sets of data. In at leastone embodiment GPGPU cores 2362 can physically execute SIMD4, SIMD8, andSIMD16 instructions and logically execute SIMD1, SIMD2, and SIMD32instructions. In at least one embodiment, SIMD instructions for GPGPUcores can be generated at compile time by a shader compiler orautomatically generated when executing programs written and compiled forsingle program multiple data (SPMD) or SIMT architectures. In at leastone embodiment, multiple threads of a program configured for an SIMTexecution model can executed via a single SIMD instruction. For example,in at least one embodiment, eight SIMT threads that perform same orsimilar operations can be executed in parallel via a single SIMD8 logicunit.

In at least one embodiment, memory and cache interconnect 2368 is aninterconnect network that connects each functional unit of graphicsmultiprocessor 2334 to register file 2358 and to shared memory 2370. Inat least one embodiment, memory and cache interconnect 2368 is acrossbar interconnect that allows load/store unit 2366 to implement loadand store operations between shared memory 2370 and register file 2358.In at least one embodiment, register file 2358 can operate at a samefrequency as GPGPU cores 2362, thus data transfer between GPGPU cores2362 and register file 2358 is very low latency. In at least oneembodiment, shared memory 2370 can be used to enable communicationbetween threads that execute on functional units within graphicsmultiprocessor 2334. In at least one embodiment, cache memory 2372 canbe used as a data cache for example, to cache texture data communicatedbetween functional units and texture unit 2336. In at least oneembodiment, shared memory 2370 can also be used as a program managedcached. In at least one embodiment, threads executing on GPGPU cores2362 can programmatically store data within shared memory in addition toautomatically cached data that is stored within cache memory 2372.

In at least one embodiment, a parallel processor or GPGPU as describedherein is communicatively coupled to host/processor cores to accelerategraphics operations, machine-learning operations, pattern analysisoperations, and various general purpose GPU (GPGPU) functions. In atleast one embodiment, GPU may be communicatively coupled to hostprocessor/cores over a bus or other interconnect (e.g., a high speedinterconnect such as PCIe or NVLink). In at least one embodiment, GPUmay be integrated on same package or chip as cores and communicativelycoupled to cores over an internal processor bus/interconnect (i.e.,internal to package or chip). In at least one embodiment, regardless ofmanner in which GPU is connected, processor cores may allocate work toGPU in form of sequences of commands/instructions contained in a workdescriptor. In at least one embodiment, GPU then uses dedicatedcircuitry/logic for efficiently processing these commands/instructions.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in graphicsmultiprocessor 2334 for inferencing or predicting operations based, atleast in part, on weight parameters calculated using neural networktraining operations, neural network functions and/or architectures, orneural network use cases described herein.

FIG. 24 illustrates a multi-GPU computing system 2400, according to atleast one embodiment. In at least one embodiment, multi-GPU computingsystem 2400 can include a processor 2402 coupled to multiple generalpurpose graphics processing units (GPGPUs) 2406A-D via a host interfaceswitch 2404. In at least one embodiment, host interface switch 2404 is aPCI express switch device that couples processor 2402 to a PCI expressbus over which processor 2402 can communicate with GPGPUs 2406A-D.GPGPUs 2406A-D can interconnect via a set of high-speed point to pointGPU to GPU links 2416. In at least one embodiment, GPU to GPU links 2416connect to each of GPGPUs 2406A-D via a dedicated GPU link. In at leastone embodiment, P2P GPU links 2416 enable direct communication betweeneach of GPGPUs 2406A-D without requiring communication over hostinterface bus 2404 to which processor 2402 is connected. In at least oneembodiment, with GPU-to-GPU traffic directed to P2P GPU links 2416, hostinterface bus 2404 remains available for system memory access or tocommunicate with other instances of multi-GPU computing system 2400, forexample, via one or more network devices. While in at least oneembodiment GPGPUs 2406A-D connect to processor 2402 via host interfaceswitch 2404, in at least one embodiment processor 2402 includes directsupport for P2P GPU links 2416 and can connect directly to GPGPUs2406A-D.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used inmulti-GPU computing system 2400 for inferencing or predicting operationsbased, at least in part, on weight parameters calculated using neuralnetwork training operations, neural network functions and/orarchitectures, or neural network use cases described herein.

FIG. 25 is a block diagram of a graphics processor 2500, according to atleast one embodiment. In at least one embodiment, graphics processor2500 includes a ring interconnect 2502, a pipeline front-end 2504, amedia engine 2537, and graphics cores 2580A-2580N. In at least oneembodiment, ring interconnect 2502 couples graphics processor 2500 toother processing units, including other graphics processors or one ormore general-purpose processor cores. In at least one embodiment,graphics processor 2500 is one of many processors integrated within amulti-core processing system.

In at least one embodiment, graphics processor 2500 receives batches ofcommands via ring interconnect 2502. In at least one embodiment,incoming commands are interpreted by a command streamer 2503 in pipelinefront-end 2504. In at least one embodiment, graphics processor 2500includes scalable execution logic to perform 3D geometry processing andmedia processing via graphics core(s) 2580A-2580N. In at least oneembodiment, for 3D geometry processing commands, command streamer 2503supplies commands to geometry pipeline 2536. In at least one embodiment,for at least some media processing commands, command streamer 2503supplies commands to a video front end 2534, which couples with a mediaengine 2537. In at least one embodiment, media engine 2537 includes aVideo Quality Engine (VQE) 2530 for video and image post-processing anda multi-format encode/decode (MFX) 2533 engine to providehardware-accelerated media data encode and decode. In at least oneembodiment, geometry pipeline 2536 and media engine 2537 each generateexecution threads for thread execution resources provided by at leastone graphics core 2580A.

In at least one embodiment, graphics processor 2500 includes scalablethread execution resources featuring modular cores 2580A-2580N(sometimes referred to as core slices), each having multiple sub-cores2550A-550N, 2560A-2560N (sometimes referred to as core sub-slices). Inat least one embodiment, graphics processor 2500 can have any number ofgraphics cores 2580A through 2580N. In at least one embodiment, graphicsprocessor 2500 includes a graphics core 2580A having at least a firstsub-core 2550A and a second sub-core 2560A. In at least one embodiment,graphics processor 2500 is a low power processor with a single sub-core(e.g., 2550A). In at least one embodiment, graphics processor 2500includes multiple graphics cores 2580A-2580N, each including a set offirst sub-cores 2550A-2550N and a set of second sub-cores 2560A-2560N.In at least one embodiment, each sub-core in first sub-cores 2550A-2550Nincludes at least a first set of execution units 2552A-2552N andmedia/texture samplers 2554A-2554N. In at least one embodiment, eachsub-core in second sub-cores 2560A-2560N includes at least a second setof execution units 2562A-2562N and samplers 2564A-2564N. In at least oneembodiment, each sub-core 2550A-2550N, 2560A-2560N shares a set ofshared resources 2570A-2570N. In at least one embodiment, sharedresources include shared cache memory and pixel operation logic.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, inference and/or training logic 1015 may be used in graphicsprocessor 2500 for inferencing or predicting operations based, at leastin part, on weight parameters calculated using neural network trainingoperations, neural network functions and/or architectures, or neuralnetwork use cases described herein.

FIG. 26 is a block diagram illustrating micro-architecture for aprocessor 2600 that may include logic circuits to perform instructions,according to at least one embodiment. In at least one embodiment,processor 2600 may perform instructions, including x86 instructions, ARMinstructions, specialized instructions for application-specificintegrated circuits (ASICs), etc. In at least one embodiment, processor2610 may include registers to store packed data, such as 64-bit wide MMXregisters in microprocessors enabled with MMX technology from IntelCorporation of Santa Clara, Calif. In at least one embodiment, MMXregisters, available in both integer and floating point forms, mayoperate with packed data elements that accompany single instruction,multiple data (“SIMD”) and streaming SIMD extensions (“SSE”)instructions. In at least one embodiment, 128-bit wide XMM registersrelating to SSE2, SSE3, SSE4, AVX, or beyond (referred to generically as“S SEx”) technology may hold such packed data operands. In at least oneembodiment, processors 2610 may perform instructions to acceleratemachine learning or deep learning algorithms, training, or inferencing.

In at least one embodiment, processor 2600 includes an in-order frontend (“front end”) 2601 to fetch instructions to be executed and prepareinstructions to be used later in processor pipeline. In at least oneembodiment, front end 2601 may include several units. In at least oneembodiment, an instruction prefetcher 2626 fetches instructions frommemory and feeds instructions to an instruction decoder 2628 which inturn decodes or interprets instructions. For example, in at least oneembodiment, instruction decoder 2628 decodes a received instruction intoone or more operations called “micro-instructions” or “micro-operations”(also called “micro ops” or “uops”) that machine may execute. In atleast one embodiment, instruction decoder 2628 parses instruction intoan opcode and corresponding data and control fields that may be used bymicro-architecture to perform operations in accordance with at least oneembodiment. In at least one embodiment, a trace cache 2630 may assembledecoded uops into program ordered sequences or traces in a uop queue2634 for execution. In at least one embodiment, when trace cache 2630encounters a complex instruction, a microcode ROM 2632 provides uopsneeded to complete operation.

In at least one embodiment, some instructions may be converted into asingle micro-op, whereas others need several micro-ops to complete fulloperation. In at least one embodiment, if more than four micro-ops areneeded to complete an instruction, instruction decoder 2628 may accessmicrocode ROM 2632 to perform instruction. In at least one embodiment,an instruction may be decoded into a small number of micro-ops forprocessing at instruction decoder 2628. In at least one embodiment, aninstruction may be stored within microcode ROM 2632 should a number ofmicro-ops be needed to accomplish operation. In at least one embodiment,trace cache 2630 refers to an entry point programmable logic array(“PLA”) to determine a correct micro-instruction pointer for readingmicrocode sequences to complete one or more instructions from microcodeROM 2632 in accordance with at least one embodiment. In at least oneembodiment, after microcode ROM 2632 finishes sequencing micro-ops foran instruction, front end 2601 of machine may resume fetching micro-opsfrom trace cache 2630.

In at least one embodiment, out-of-order execution engine (“out of orderengine”) 2603 may prepare instructions for execution. In at least oneembodiment, out-of-order execution logic has a number of buffers tosmooth out and re-order flow of instructions to optimize performance asthey go down pipeline and get scheduled for execution. out-of-orderexecution engine 2603 includes, without limitation, anallocator/register renamer 2640, a memory uop queue 2642, aninteger/floating point uop queue 2644, a memory scheduler 2646, a fastscheduler 2602, a slow/general floating point scheduler (“slow/generalFP scheduler”) 2604, and a simple floating point scheduler (“simple FPscheduler”) 2606. In at least one embodiment, fast schedule 2602,slow/general floating point scheduler 2604, and simple floating pointscheduler 2606 are also collectively referred to herein as “uopschedulers 2602, 2604, 2606.” allocator/register renamer 2640 allocatesmachine buffers and resources that each uop needs in order to execute.In at least one embodiment, allocator/register renamer 2640 renameslogic registers onto entries in a register file. In at least oneembodiment, allocator/register renamer 2640 also allocates an entry foreach uop in one of two uop queues, memory uop queue 2642 for memoryoperations and integer/floating point uop queue 2644 for non-memoryoperations, in front of memory scheduler 2646 and uop schedulers 2602,2604, 2606. In at least one embodiment, uop schedulers 2602, 2604, 2606,determine when a uop is ready to execute based on readiness of theirdependent input register operand sources and availability of executionresources uops need to complete their operation. In at least oneembodiment, fast scheduler 2602 of at least one embodiment may scheduleon each half of main clock cycle while slow/general floating pointscheduler 2604 and simple floating point scheduler 2606 may scheduleonce per main processor clock cycle. In at least one embodiment, uopschedulers 2602, 2604, 2606 arbitrate for dispatch ports to scheduleuops for execution.

In at least one embodiment, execution block b11 includes, withoutlimitation, an integer register file/bypass network 2608, a floatingpoint register file/bypass network (“FP register file/bypass network”)2610, address generation units (“AGUs”) 2612 and 2614, fast ArithmeticLogic Units (ALUs) (“fast ALUs”) 2616 and 2618, a slow Arithmetic LogicUnit (“slow ALU”) 2620, a floating point ALU (“FP”) 2622, and a floatingpoint move unit (“FP move”) 2624. In at least one embodiment, integerregister file/bypass network 2608 and floating point registerfile/bypass network 2610 are also referred to herein as “register files2608, 2610.” In at least one embodiment, AGUSs 2612 and 2614, fast ALUs2616 and 2618, slow ALU 2620, floating point ALU 2622, and floatingpoint move unit 2624 are also referred to herein as “execution units2612, 2614, 2616, 2618, 2620, 2622, and 2624.” In at least oneembodiment, execution block b11 may include, without limitation, anynumber (including zero) and type of register files, bypass networks,address generation units, and execution units, in any combination.

In at least one embodiment, register files 2608, 2610 may be arrangedbetween uop schedulers 2602, 2604, 2606, and execution units 2612, 2614,2616, 2618, 2620, 2622, and 2624. In at least one embodiment, integerregister file/bypass network 2608 performs integer operations. In atleast one embodiment, floating point register file/bypass network 2610performs floating point operations. In at least one embodiment, each ofregister files 2608, 2610 may include, without limitation, a bypassnetwork that may bypass or forward just completed results that have notyet been written into register file to new dependent uops. In at leastone embodiment, register files 2608, 2610 may communicate data with eachother. In at least one embodiment, integer register file/bypass network2608 may include, without limitation, two separate register files, oneregister file for low-order thirty-two bits of data and a secondregister file for high order thirty-two bits of data. In at least oneembodiment, floating point register file/bypass network 2610 mayinclude, without limitation, 128-bit wide entries because floating pointinstructions typically have operands from 64 to 128 bits in width.

In at least one embodiment, execution units 2612, 2614, 2616, 2618,2620, 2622, 2624 may execute instructions. In at least one embodiment,register files 2608, 2610 store integer and floating point data operandvalues that micro-instructions need to execute. In at least oneembodiment, processor 2600 may include, without limitation, any numberand combination of execution units 2612, 2614, 2616, 2618, 2620, 2622,2624. In at least one embodiment, floating point ALU 2622 and floatingpoint move unit 2624, may execute floating point, MMX, SIMD, AVX andSSE, or other operations, including specialized machine learninginstructions. In at least one embodiment, floating point ALU 2622 mayinclude, without limitation, a 64-bit by 64-bit floating point dividerto execute divide, square root, and remainder micro ops. In at least oneembodiment, instructions involving a floating point value may be handledwith floating point hardware. In at least one embodiment, ALU operationsmay be passed to fast ALUs 2616, 2618. In at least one embodiment, fastALUS 2616, 2618 may execute fast operations with an effective latency ofhalf a clock cycle. In at least one embodiment, most complex integeroperations go to slow ALU 2620 as slow ALU 2620 may include, withoutlimitation, integer execution hardware for long-latency type ofoperations, such as a multiplier, shifts, flag logic, and branchprocessing. In at least one embodiment, memory load/store operations maybe executed by AGUS 2612, 2614. In at least one embodiment, fast ALU2616, fast ALU 2618, and slow ALU 2620 may perform integer operations on64-bit data operands. In at least one embodiment, fast ALU 2616, fastALU 2618, and slow ALU 2620 may be implemented to support a variety ofdata bit sizes including sixteen, thirty-two, 128, 256, etc. In at leastone embodiment, floating point ALU 2622 and floating point move unit2624 may be implemented to support a range of operands having bits ofvarious widths. In at least one embodiment, floating point ALU 2622 andfloating point move unit 2624 may operate on 128-bit wide packed dataoperands in conjunction with SIMD and multimedia instructions.

In at least one embodiment, uop schedulers 2602, 2604, 2606, dispatchdependent operations before parent load has finished executing. In atleast one embodiment, as uops may be speculatively scheduled andexecuted in processor 2600, processor 2600 may also include logic tohandle memory misses. In at least one embodiment, if a data load missesin data cache, there may be dependent operations in flight in pipelinethat have left scheduler with temporarily incorrect data. In at leastone embodiment, a replay mechanism tracks and re-executes instructionsthat use incorrect data. In at least one embodiment, dependentoperations might need to be replayed and independent ones may be allowedto complete. In at least one embodiment, schedulers and replay mechanismof at least one embodiment of a processor may also be designed to catchinstruction sequences for text string comparison operations.

In at least one embodiment, term “registers” may refer to on-boardprocessor storage locations that may be used as part of instructions toidentify operands. In at least one embodiment, registers may be thosethat may be usable from outside of processor (from a programmer'sperspective). In at least one embodiment, registers might not be limitedto a particular type of circuit. Rather, in at least one embodiment, aregister may store data, provide data, and perform functions describedherein. In at least one embodiment, registers described herein may beimplemented by circuitry within a processor using any number ofdifferent techniques, such as dedicated physical registers, dynamicallyallocated physical registers using register renaming, combinations ofdedicated and dynamically allocated physical registers, etc. In at leastone embodiment, integer registers store 32-bit integer data. A registerfile of at least one embodiment also contains eight multimedia SIMDregisters for packed data.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment portions or all of inference and/or training logic 1015 maybe incorporated into EXE Block 2611 and other memory or registers shownor not shown. For example, in at least one embodiment, training and/orinferencing techniques described herein may use one or more of ALUsillustrated in EXE Block 2611. Moreover, weight parameters may be storedin on-chip or off-chip memory and/or registers (shown or not shown) thatconfigure ALUs of EXE Block 2611 to perform one or more machine learningalgorithms, neural network architectures, use cases, or trainingtechniques described herein.

FIG. 27 illustrates a deep learning application processor 2700,according to at least one embodiment. In at least one embodiment, deeplearning application processor 2700 uses instructions that, if executedby deep learning application processor 2700, cause deep learningapplication processor 2700 to perform some or all of processes andtechniques described throughout this disclosure. In at least oneembodiment, deep learning application processor 2700 is anapplication-specific integrated circuit (ASIC). In at least oneembodiment, application processor 2700 performs matrix multiplyoperations either “hard-wired” into hardware as a result of performingone or more instructions or both. In at least one embodiment, deeplearning application processor 2700 includes, without limitation,processing clusters 2710(1)-2710(12), Inter-Chip Links (“ICLs”)2720(1)-2720(12), Inter-Chip Controllers (“ICCs”) 2730(1)-2730(2), highbandwidth memory second generation (“HBM2”) 2740(1)-2740(4), memorycontrollers (“Mem Ctrlrs”) 2742(1)-2742(4), high bandwidth memoryphysical layer (“HBM PHY”) 2744(1)-2744(4), a management-controllercentral processing unit (“management-controller CPU”) 2750, a SerialPeripheral Interface, Inter-Integrated Circuit, and General PurposeInput/Output block (“SPI, I2C, GPIO”) 2760, a peripheral componentinterconnect express controller and direct memory access block (“PCIeController and DMA”) 2770, and a sixteen-lane peripheral componentinterconnect express port (“PCI Express x16”) 2780.

In at least one embodiment, processing clusters 2710 may perform deeplearning operations, including inference or prediction operations basedon weight parameters calculated one or more training techniques,including those described herein. In at least one embodiment, eachprocessing cluster 2710 may include, without limitation, any number andtype of processors. In at least one embodiment, deep learningapplication processor 2700 may include any number and type of processingclusters 2700. In at least one embodiment, Inter-Chip Links 2720 arebi-directional. In at least one embodiment, Inter-Chip Links 2720 andInter-Chip Controllers 2730 enable multiple deep learning applicationprocessors 2700 to exchange information, including activationinformation resulting from performing one or more machine learningalgorithms embodied in one or more neural networks. In at least oneembodiment, deep learning application processor 2700 may include anynumber (including zero) and type of ICLs 2720 and ICCs 2730.

In at least one embodiment, HBM2s 2740 provide a total of 32 Gigabytes(GB) of memory. HBM2 2740(i) is associated with both memory controller2742(i) and HBM PHY 2744(i). In at least one embodiment, any number ofHBM2s 2740 may provide any type and total amount of high bandwidthmemory and may be associated with any number (including zero) and typeof memory controllers 2742 and HBM PHYs 2744. In at least oneembodiment, SPI, I2C, GPIO 2760, PCIe Controller and DMA 2770, and/orPCIe 2780 may be replaced with any number and type of blocks that enableany number and type of communication standards in any technicallyfeasible fashion.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, deep learning application processor is used to train amachine learning model, such as a neural network, to predict or inferinformation provided to deep learning application processor 2700. In atleast one embodiment, deep learning application processor 2700 is usedto infer or predict information based on a trained machine learningmodel (e.g., neural network) that has been trained by another processoror system or by deep learning application processor 2700. In at leastone embodiment, processor 2700 may be used to perform one or more neuralnetwork use cases described herein.

FIG. 28 is a block diagram of a neuromorphic processor 2800, accordingto at least one embodiment. In at least one embodiment, neuromorphicprocessor 2800 may receive one or more inputs from sources external toneuromorphic processor 2800. In at least one embodiment, these inputsmay be transmitted to one or more neurons 2802 within neuromorphicprocessor 2800. In at least one embodiment, neurons 2802 and componentsthereof may be implemented using circuitry or logic, including one ormore arithmetic logic units (ALUs). In at least one embodiment,neuromorphic processor 2800 may include, without limitation, thousandsor millions of instances of neurons 2802, but any suitable number ofneurons 2802 may be used. In at least one embodiment, each instance ofneuron 2802 may include a neuron input 2804 and a neuron output 2806. Inat least one embodiment, neurons 2802 may generate outputs that may betransmitted to inputs of other instances of neurons 2802. For example,in at least one embodiment, neuron inputs 2804 and neuron outputs 2806may be interconnected via synapses 2808.

In at least one embodiment, neurons 2802 and synapses 2808 may beinterconnected such that neuromorphic processor 2800 operates to processor analyze information received by neuromorphic processor 2800. In atleast one embodiment, neurons 2802 may transmit an output pulse (or“fire” or “spike”) when inputs received through neuron input 2804 exceeda threshold. In at least one embodiment, neurons 2802 may sum orintegrate signals received at neuron inputs 2804. For example, in atleast one embodiment, neurons 2802 may be implemented as leakyintegrate-and-fire neurons, wherein if a sum (referred to as a “membranepotential”) exceeds a threshold value, neuron 2802 may generate anoutput (or “fire”) using a transfer function such as a sigmoid orthreshold function. In at least one embodiment, a leakyintegrate-and-fire neuron may sum signals received at neuron inputs 2804into a membrane potential and may also apply a decay factor (or leak) toreduce a membrane potential. In at least one embodiment, a leakyintegrate-and-fire neuron may fire if multiple input signals arereceived at neuron inputs 2804 rapidly enough to exceed a thresholdvalue (i.e., before a membrane potential decays too low to fire). In atleast one embodiment, neurons 2802 may be implemented using circuits orlogic that receive inputs, integrate inputs into a membrane potential,and decay a membrane potential. In at least one embodiment, inputs maybe averaged, or any other suitable transfer function may be used.Furthermore, in at least one embodiment, neurons 2802 may include,without limitation, comparator circuits or logic that generate an outputspike at neuron output 2806 when result of applying a transfer functionto neuron input 2804 exceeds a threshold. In at least one embodiment,once neuron 2802 fires, it may disregard previously received inputinformation by, for example, resetting a membrane potential to 0 oranother suitable default value. In at least one embodiment, oncemembrane potential is reset to 0, neuron 2802 may resume normaloperation after a suitable period of time (or refractory period).

In at least one embodiment, neurons 2802 may be interconnected throughsynapses 2808. In at least one embodiment, synapses 2808 may operate totransmit signals from an output of a first neuron 2802 to an input of asecond neuron 2802. In at least one embodiment, neurons 2802 maytransmit information over more than one instance of synapse 2808. In atleast one embodiment, one or more instances of neuron output 2806 may beconnected, via an instance of synapse 2808, to an instance of neuroninput 2804 in same neuron 2802. In at least one embodiment, an instanceof neuron 2802 generating an output to be transmitted over an instanceof synapse 2808 may be referred to as a “pre-synaptic neuron” withrespect to that instance of synapse 2808. In at least one embodiment, aninstance of neuron 2802 receiving an input transmitted over an instanceof synapse 2808 may be referred to as a “post-synaptic neuron” withrespect to that instance of synapse 2808. Because an instance of neuron2802 may receive inputs from one or more instances of synapse 2808, andmay also transmit outputs over one or more instances of synapse 2808, asingle instance of neuron 2802 may therefore be both a “pre-synapticneuron” and “post-synaptic neuron,” with respect to various instances ofsynapses 2808, in at least one embodiment.

In at least one embodiment, neurons 2802 may be organized into one ormore layers. Each instance of neuron 2802 may have one neuron output2806 that may fan out through one or more synapses 2808 to one or moreneuron inputs 2804. In at least one embodiment, neuron outputs 2806 ofneurons 2802 in a first layer 2810 may be connected to neuron inputs2804 of neurons 2802 in a second layer 2812. In at least one embodiment,layer 2810 may be referred to as a “feed-forward layer.” In at least oneembodiment, each instance of neuron 2802 in an instance of first layer2810 may fan out to each instance of neuron 2802 in second layer 2812.In at least one embodiment, first layer 2810 may be referred to as a“fully connected feed-forward layer.” In at least one embodiment, eachinstance of neuron 2802 in an instance of second layer 2812 may fan outto fewer than all instances of neuron 2802 in a third layer 2814. In atleast one embodiment, second layer 2812 may be referred to as a“sparsely connected feed-forward layer.” In at least one embodiment,neurons 2802 in second layer 2812 may fan out to neurons 2802 inmultiple other layers, including to neurons 2802 in (same) second layer2812. In at least one embodiment, second layer 2812 may be referred toas a “recurrent layer.” Neuromorphic processor 2800 may include, withoutlimitation, any suitable combination of recurrent layers andfeed-forward layers, including, without limitation, both sparselyconnected feed-forward layers and fully connected feed-forward layers.

In at least one embodiment, neuromorphic processor 2800 may include,without limitation, a reconfigurable interconnect architecture ordedicated hard wired interconnects to connect synapse 2808 to neurons2802. In at least one embodiment, neuromorphic processor 2800 mayinclude, without limitation, circuitry or logic that allows synapses tobe allocated to different neurons 2802 as needed based on neural networktopology and neuron fan-in/out. For example, in at least one embodiment,synapses 2808 may be connected to neurons 2802 using an interconnectfabric, such as network-on-chip, or with dedicated connections. In atleast one embodiment, synapse interconnections and components thereofmay be implemented using circuitry or logic.

FIG. 29 is a block diagram of a processing system, according to at leastone embodiment. In at least one embodiment, system 2900 includes one ormore processors 2902 and one or more graphics processors 2908, and maybe a single processor desktop system, a multiprocessor workstationsystem, or a server system having a large number of processors 2902 orprocessor cores 2907. In at least one embodiment, system 2900 is aprocessing platform incorporated within a system-on-a-chip (SoC)integrated circuit for use in mobile, handheld, or embedded devices.

In at least one embodiment, system 2900 can include, or be incorporatedwithin a server-based gaming platform, a game console, including a gameand media console, a mobile gaming console, a handheld game console, oran online game console. In at least one embodiment, system 2900 is amobile phone, smart phone, tablet computing device or mobile Internetdevice. In at least one embodiment, processing system 2900 can alsoinclude, couple with, or be integrated within a wearable device, such asa smart watch wearable device, smart eyewear device, augmented realitydevice, or virtual reality device. In at least one embodiment,processing system 2900 is a television or set top box device having oneor more processors 2902 and a graphical interface generated by one ormore graphics processors 2908.

In at least one embodiment, one or more processors 2902 each include oneor more processor cores 2907 to process instructions which, whenexecuted, perform operations for system and user software. In at leastone embodiment, each of one or more processor cores 2907 is configuredto process a specific instruction set 2909. In at least one embodiment,instruction set 2909 may facilitate Complex Instruction Set Computing(CISC), Reduced Instruction Set Computing (RISC), or computing via aVery Long Instruction Word (VLIW). In at least one embodiment, processorcores 2907 may each process a different instruction set 2909, which mayinclude instructions to facilitate emulation of other instruction sets.In at least one embodiment, processor core 2907 may also include otherprocessing devices, such a Digital Signal Processor (DSP).

In at least one embodiment, processor 2902 includes cache memory 2904.In at least one embodiment, processor 2902 can have a single internalcache or multiple levels of internal cache. In at least one embodiment,cache memory is shared among various components of processor 2902. In atleast one embodiment, processor 2902 also uses an external cache (e.g.,a Level-3 (L3) cache or Last Level Cache (LLC)) (not shown), which maybe shared among processor cores 2907 using known cache coherencytechniques. In at least one embodiment, register file 2906 isadditionally included in processor 2902 which may include differenttypes of registers for storing different types of data (e.g., integerregisters, floating point registers, status registers, and aninstruction pointer register). In at least one embodiment, register file2906 may include general-purpose registers or other registers.

In at least one embodiment, one or more processor(s) 2902 are coupledwith one or more interface bus(es) 2910 to transmit communicationsignals such as address, data, or control signals between processor 2902and other components in system 2900. In at least one embodimentinterface bus 2910, in one embodiment, can be a processor bus, such as aversion of a Direct Media Interface (DMI) bus. In at least oneembodiment, interface 2910 is not limited to a DMI bus, and may includeone or more Peripheral Component Interconnect buses (e.g., PCI, PCIExpress), memory busses, or other types of interface busses. In at leastone embodiment processor(s) 2902 include an integrated memory controller2916 and a platform controller hub 2930. In at least one embodiment,memory controller 2916 facilitates communication between a memory deviceand other components of system 2900, while platform controller hub (PCH)2930 provides connections to I/O devices via a local I/O bus.

In at least one embodiment, memory device 2920 can be a dynamic randomaccess memory (DRAM) device, a static random access memory (SRAM)device, flash memory device, phase-change memory device, or some othermemory device having suitable performance to serve as process memory. Inat least one embodiment memory device 2920 can operate as system memoryfor system 2900, to store data 2922 and instructions 2921 for use whenone or more processors 2902 executes an application or process. In atleast one embodiment, memory controller 2916 also couples with anoptional external graphics processor 2912, which may communicate withone or more graphics processors 2908 in processors 2902 to performgraphics and media operations. In at least one embodiment, a displaydevice 2911 can connect to processor(s) 2902. In at least one embodimentdisplay device 2911 can include one or more of an internal displaydevice, as in a mobile electronic device or a laptop device or anexternal display device attached via a display interface (e.g.,DisplayPort, etc.). In at least one embodiment, display device 2911 caninclude a head mounted display (HMD) such as a stereoscopic displaydevice for use in virtual reality (VR) applications or augmented reality(AR) applications.

In at least one embodiment, platform controller hub 2930 enablesperipherals to connect to memory device 2920 and processor 2902 via ahigh-speed I/O bus. In at least one embodiment, I/O peripherals include,but are not limited to, an audio controller 2946, a network controller2934, a firmware interface 2928, a wireless transceiver 2926, touchsensors 2925, a data storage device 2924 (e.g., hard disk drive, flashmemory, etc.). In at least one embodiment, data storage device 2924 canconnect via a storage interface (e.g., SATA) or via a peripheral bus,such as a Peripheral Component Interconnect bus (e.g., PCI, PCIExpress). In at least one embodiment, touch sensors 2925 can includetouch screen sensors, pressure sensors, or fingerprint sensors. In atleast one embodiment, wireless transceiver 2926 can be a Wi-Fitransceiver, a Bluetooth transceiver, or a mobile network transceiversuch as a 3G, 4G, or Long Term Evolution (LTE) transceiver. In at leastone embodiment, firmware interface 2928 enables communication withsystem firmware, and can be, for example, a unified extensible firmwareinterface (UEFI). In at least one embodiment, network controller 2934can enable a network connection to a wired network. In at least oneembodiment, a high-performance network controller (not shown) coupleswith interface bus 2910. In at least one embodiment, audio controller2946 is a multi-channel high definition audio controller. In at leastone embodiment, system 2900 includes an optional legacy I/O controller2940 for coupling legacy (e.g., Personal System 2 (PS/2)) devices tosystem. In at least one embodiment, platform controller hub 2930 canalso connect to one or more Universal Serial Bus (USB) controllers 2942connect input devices, such as keyboard and mouse 2943 combinations, acamera 2944, or other USB input devices.

In at least one embodiment, an instance of memory controller 2916 andplatform controller hub 2930 may be integrated into a discreet externalgraphics processor, such as external graphics processor 2912. In atleast one embodiment, platform controller hub 2930 and/or memorycontroller 2916 may be external to one or more processor(s) 2902. Forexample, in at least one embodiment, system 2900 can include an externalmemory controller 2916 and platform controller hub 2930, which may beconfigured as a memory controller hub and peripheral controller hubwithin a system chipset that is in communication with processor(s) 2902.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment portions or all of inference and/or training logic 1015 maybe incorporated into graphics processor 2900. For example, in at leastone embodiment, training and/or inferencing techniques described hereinmay use one or more of ALUs embodied in 3D pipeline 2912. Moreover, inat least one embodiment, inferencing and/or training operationsdescribed herein may be done using logic other than logic illustrated inFIG. 10A or 10B. In at least one embodiment, weight parameters may bestored in on-chip or off-chip memory and/or registers (shown or notshown) that configure ALUs of graphics processor 2900 to perform one ormore machine learning algorithms, neural network architectures, usecases, or training techniques described herein.

FIG. 30 is a block diagram of a processor 3000 having one or moreprocessor cores 3002A-3002N, an integrated memory controller 3014, andan integrated graphics processor 3008, according to at least oneembodiment. In at least one embodiment, processor 3000 can includeadditional cores up to and including additional core 3002N representedby dashed lined boxes. In at least one embodiment, each of processorcores 3002A-3002N includes one or more internal cache units 3004A-3004N.In at least one embodiment, each processor core also has access to oneor more shared cached units 3006.

In at least one embodiment, internal cache units 3004A-3004N and sharedcache units 3006 represent a cache memory hierarchy within processor3000. In at least one embodiment, cache memory units 3004A-3004N mayinclude at least one level of instruction and data cache within eachprocessor core and one or more levels of shared mid-level cache, such asa Level 2 (L2), Level 3 (L3), Level 4 (L4), or other levels of cache,where a highest level of cache before external memory is classified asan LLC. In at least one embodiment, cache coherency logic maintainscoherency between various cache units 3006 and 3004A-3004N.

In at least one embodiment, processor 3000 may also include a set of oneor more bus controller units 3016 and a system agent core 3010. In atleast one embodiment, one or more bus controller units 3016 manage a setof peripheral buses, such as one or more PCI or PCI express busses. Inat least one embodiment, system agent core 3010 provides managementfunctionality for various processor components. In at least oneembodiment, system agent core 3010 includes one or more integratedmemory controllers 3014 to manage access to various external memorydevices (not shown).

In at least one embodiment, one or more of processor cores 3002A-3002Ninclude support for simultaneous multi-threading. In at least oneembodiment, system agent core 3010 includes components for coordinatingand operating cores 3002A-3002N during multi-threaded processing. In atleast one embodiment, system agent core 3010 may additionally include apower control unit (PCU), which includes logic and components toregulate one or more power states of processor cores 3002A-3002N andgraphics processor 3008.

In at least one embodiment, processor 3000 additionally includesgraphics processor 3008 to execute graphics processing operations. In atleast one embodiment, graphics processor 3008 couples with shared cacheunits 3006, and system agent core 3010, including one or more integratedmemory controllers 3014. In at least one embodiment, system agent core3010 also includes a display controller 3011 to drive graphics processoroutput to one or more coupled displays. In at least one embodiment,display controller 3011 may also be a separate module coupled withgraphics processor 3008 via at least one interconnect, or may beintegrated within graphics processor 3008.

In at least one embodiment, a ring based interconnect unit 3012 is usedto couple internal components of processor 3000. In at least oneembodiment, an alternative interconnect unit may be used, such as apoint-to-point interconnect, a switched interconnect, or othertechniques. In at least one embodiment, graphics processor 3008 coupleswith ring interconnect 3012 via an I/O link 3013.

In at least one embodiment, I/O link 3013 represents at least one ofmultiple varieties of I/O interconnects, including an on package I/Ointerconnect which facilitates communication between various processorcomponents and a high-performance embedded memory module 3018, such asan eDRAM module. In at least one embodiment, each of processor cores3002A-3002N and graphics processor 3008 use embedded memory modules 3018as a shared Last Level Cache.

In at least one embodiment, processor cores 3002A-3002N are homogenouscores executing a common instruction set architecture. In at least oneembodiment, processor cores 3002A-3002N are heterogeneous in terms ofinstruction set architecture (ISA), where one or more of processor cores3002A-3002N execute a common instruction set, while one or more othercores of processor cores 3002A-3002N executes a subset of a commoninstruction set or a different instruction set. In at least oneembodiment, processor cores 3002A-3002N are heterogeneous in terms ofmicroarchitecture, where one or more cores having a relatively higherpower consumption couple with one or more power cores having a lowerpower consumption. In at least one embodiment, processor 3000 can beimplemented on one or more chips or as an SoC integrated circuit.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment portions or all of inference and/or training logic 1015 maybe incorporated into graphics processor 3010. For example, in at leastone embodiment, training and/or inferencing techniques described hereinmay use one or more of ALUs embodied in 3D pipeline 2912, graphicscore(s) 3015A, shared function logic 3016, graphics core(s) 3015B,shared function logic 3020, or other logic in FIG. 30. Moreover, in atleast one embodiment, inferencing and/or training operations describedherein may be done using logic other than logic illustrated in FIG. 10Aor 10B. In at least one embodiment, weight parameters may be stored inon-chip or off-chip memory and/or registers (shown or not shown) thatconfigure ALUs of graphics processor 3010 to perform one or more machinelearning algorithms, neural network architectures, use cases, ortraining techniques described herein.

FIG. 31 is a block diagram of a graphics processor 3100, which may be adiscrete graphics processing unit, or may be a graphics processorintegrated with a plurality of processing cores. In at least oneembodiment, graphics processor 3100 communicates via a memory mapped I/Ointerface to registers on graphics processor 3100 and with commandsplaced into memory. In at least one embodiment, graphics processor 3100includes a memory interface 3114 to access memory. In at least oneembodiment, memory interface 3114 is an interface to local memory, oneor more internal caches, one or more shared external caches, and/or tosystem memory.

In at least one embodiment, graphics processor 3100 also includes adisplay controller 3102 to drive display output data to a display device3120. In at least one embodiment, display controller 3102 includeshardware for one or more overlay planes for display device 3120 andcomposition of multiple layers of video or user interface elements. Inat least one embodiment, display device 3120 can be an internal orexternal display device. In at least one embodiment, display device 3120is a head mounted display device, such as a virtual reality (VR) displaydevice or an augmented reality (AR) display device. In at least oneembodiment, graphics processor 3100 includes a video codec engine 3106to encode, decode, or transcode media to, from, or between one or moremedia encoding formats, including, but not limited to Moving PictureExperts Group (MPEG) formats such as MPEG-2, Advanced Video Coding (AVC)formats such as H.264/MPEG-4 AVC, as well as the Society of MotionPicture & Television Engineers (SMPTE) 421M/VC-1, and Joint PhotographicExperts Group (JPEG) formats such as JPEG, and Motion JPEG (MJPEG)formats.

In at least one embodiment, graphics processor 3100 includes a blockimage transfer (BLIT) engine 3104 to perform two-dimensional (2D)rasterizer operations including, for example, bit-boundary blocktransfers. However, in at least one embodiment, 2D graphics operationsare performed using one or more components of graphics processing engine(GPE) 3110. In at least one embodiment, GPE 3110 is a compute engine forperforming graphics operations, including three-dimensional (3D)graphics operations and media operations.

In at least one embodiment, GPE 3110 includes a 3D pipeline 3112 forperforming 3D operations, such as rendering three-dimensional images andscenes using processing functions that act upon 3D primitive shapes(e.g., rectangle, triangle, etc.). 3D pipeline 3112 includesprogrammable and fixed function elements that perform various tasksand/or spawn execution threads to a 3D/Media sub-system 3115. While 3Dpipeline 3112 can be used to perform media operations, in at least oneembodiment, GPE 3110 also includes a media pipeline 3116 that is used toperform media operations, such as video post-processing and imageenhancement.

In at least one embodiment, media pipeline 3116 includes fixed functionor programmable logic units to perform one or more specialized mediaoperations, such as video decode acceleration, video de-interlacing, andvideo encode acceleration in place of, or on behalf of video codecengine 3106. In at least one embodiment, media pipeline 3116additionally includes a thread spawning unit to spawn threads forexecution on 3D/Media sub-system 3115. In at least one embodiment,spawned threads perform computations for media operations on one or moregraphics execution units included in 3D/Media sub-system 3115.

In at least one embodiment, 3D/Media subsystem 3115 includes logic forexecuting threads spawned by 3D pipeline 3112 and media pipeline 3116.In at least one embodiment, 3D pipeline 3112 and media pipeline 3116send thread execution requests to 3D/Media subsystem 3115, whichincludes thread dispatch logic for arbitrating and dispatching variousrequests to available thread execution resources. In at least oneembodiment, execution resources include an array of graphics executionunits to process 3D and media threads. In at least one embodiment,3D/Media subsystem 3115 includes one or more internal caches for threadinstructions and data. In at least one embodiment, subsystem 3115 alsoincludes shared memory, including registers and addressable memory, toshare data between threads and to store output data.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment portions or all of inference and/or training logic 1015 maybe incorporated into graphics processor 3100. For example, in at leastone embodiment, training and/or inferencing techniques described hereinmay use one or more of ALUs embodied in 3D pipeline 3112. Moreover, inat least one embodiment, inferencing and/or training operationsdescribed herein may be done using logic other than logic illustrated inFIG. 10A or 10B. In at least one embodiment, weight parameters may bestored in on-chip or off-chip memory and/or registers (shown or notshown) that configure ALUs of graphics processor 3100 to perform one ormore machine learning algorithms, neural network architectures, usecases, or training techniques described herein.

FIG. 32 is a block diagram of a graphics processing engine 3210 of agraphics processor in accordance with at least one embodiment. In atleast one embodiment, graphics processing engine (GPE) 3210 is a versionof GPE 3110 shown in FIG. 31. In at least one embodiment, media pipeline3116 is optional and may not be explicitly included within GPE 3210. Inat least one embodiment, a separate media and/or image processor iscoupled to GPE 3210.

In at least one embodiment, GPE 3210 is coupled to or includes a commandstreamer 3203, which provides a command stream to 3D pipeline 3112and/or media pipelines 3116. In at least one embodiment, commandstreamer 3203 is coupled to memory, which can be system memory, or oneor more of internal cache memory and shared cache memory. In at leastone embodiment, command streamer 3203 receives commands from memory andsends commands to 3D pipeline 3112 and/or media pipeline 3116. In atleast one embodiment, commands are instructions, primitives, ormicro-operations fetched from a ring buffer, which stores commands for3D pipeline 3112 and media pipeline 3116. In at least one embodiment, aring buffer can additionally include batch command buffers storingbatches of multiple commands. In at least one embodiment, commands for3D pipeline 3112 can also include references to data stored in memory,such as but not limited to vertex and geometry data for 3D pipeline 3112and/or image data and memory objects for media pipeline 3116. In atleast one embodiment, 3D pipeline 3112 and media pipeline 3116 processcommands and data by performing operations or by dispatching one or moreexecution threads to a graphics core array 3214. In at least oneembodiment graphics core array 3214 includes one or more blocks ofgraphics cores (e.g., graphics core(s) 3215A, graphics core(s) 3215B),each block including one or more graphics cores. In at least oneembodiment, each graphics core includes a set of graphics executionresources that includes general-purpose and graphics specific executionlogic to perform graphics and compute operations, as well as fixedfunction texture processing and/or machine learning and artificialintelligence acceleration logic, including inference and/or traininglogic 1015 in FIG. 10A and FIG. 10B.

In at least one embodiment, 3D pipeline 3112 includes fixed function andprogrammable logic to process one or more shader programs, such asvertex shaders, geometry shaders, pixel shaders, fragment shaders,compute shaders, or other shader programs, by processing instructionsand dispatching execution threads to graphics core array 3214. In atleast one embodiment, graphics core array 3214 provides a unified blockof execution resources for use in processing shader programs. In atleast one embodiment, multi-purpose execution logic (e.g., executionunits) within graphics core(s) 3215A-3215B of graphic core array 3214includes support for various 3D API shader languages and can executemultiple simultaneous execution threads associated with multipleshaders.

In at least one embodiment, graphics core array 3214 also includesexecution logic to perform media functions, such as video and/or imageprocessing. In at least one embodiment, execution units additionallyinclude general-purpose logic that is programmable to perform parallelgeneral-purpose computational operations, in addition to graphicsprocessing operations.

In at least one embodiment, output data generated by threads executingon graphics core array 3214 can output data to memory in a unifiedreturn buffer (URB) 3218. URB 3218 can store data for multiple threads.In at least one embodiment, URB 3218 may be used to send data betweendifferent threads executing on graphics core array 3214. In at least oneembodiment, URB 3218 may additionally be used for synchronizationbetween threads on graphics core array 3214 and fixed function logicwithin shared function logic 3220.

In at least one embodiment, graphics core array 3214 is scalable, suchthat graphics core array 3214 includes a variable number of graphicscores, each having a variable number of execution units based on atarget power and performance level of GPE 3210. In at least oneembodiment, execution resources are dynamically scalable, such thatexecution resources may be enabled or disabled as needed.

In at least one embodiment, graphics core array 3214 is coupled toshared function logic 3220 that includes multiple resources that areshared between graphics cores in graphics core array 3214. In at leastone embodiment, shared functions performed by shared function logic 3220are embodied in hardware logic units that provide specializedsupplemental functionality to graphics core array 3214. In at least oneembodiment, shared function logic 3220 includes but is not limited tosampler 3221, math 3222, and inter-thread communication (ITC) 3223logic. In at least one embodiment, one or more cache(s) 3225 areincluded in or couple to shared function logic 3220.

In at least one embodiment, a shared function is used if demand for aspecialized function is insufficient for inclusion within graphics corearray 3214. In at least one embodiment, a single instantiation of aspecialized function is used in shared function logic 3220 and sharedamong other execution resources within graphics core array 3214. In atleast one embodiment, specific shared functions within shared functionlogic 3220 that are used extensively by graphics core array 3214 may beincluded within shared function logic 3216 within graphics core array3214. In at least one embodiment, shared function logic 3216 withingraphics core array 3214 can include some or all logic within sharedfunction logic 3220. In at least one embodiment, all logic elementswithin shared function logic 3220 may be duplicated within sharedfunction logic 3216 of graphics core array 3214. In at least oneembodiment, shared function logic 3220 is excluded in favor of sharedfunction logic 3216 within graphics core array 3214.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment portions or all of inference and/or training logic 1015 maybe incorporated into graphics processor 3210. For example, in at leastone embodiment, training and/or inferencing techniques described hereinmay use one or more of ALUs embodied in 3D pipeline 3112, graphicscore(s) 3215A, shared function logic 3216, graphics core(s) 3215B,shared function logic 3220, or other logic in FIG. 32. Moreover, in atleast one embodiment, inferencing and/or training operations describedherein may be done using logic other than logic illustrated in FIG. 10Aor 10B. In at least one embodiment, weight parameters may be stored inon-chip or off-chip memory and/or registers (shown or not shown) thatconfigure ALUs of graphics processor 3210 to perform one or more machinelearning algorithms, neural network architectures, use cases, ortraining techniques described herein.

FIG. 33 is a block diagram of hardware logic of a graphics processorcore 3300, according to at least one embodiment described herein. In atleast one embodiment, graphics processor core 3300 is included within agraphics core array. In at least one embodiment, graphics processor core3300, sometimes referred to as a core slice, can be one or multiplegraphics cores within a modular graphics processor. In at least oneembodiment, graphics processor core 3300 is exemplary of one graphicscore slice, and a graphics processor as described herein may includemultiple graphics core slices based on target power and performanceenvelopes. In at least one embodiment, each graphics core 3300 caninclude a fixed function block 3330 coupled with multiple sub-cores3301A-3301F, also referred to as sub-slices, that include modular blocksof general-purpose and fixed function logic.

In at least one embodiment, fixed function block 3330 includes ageometry/fixed function pipeline 3336 that can be shared by allsub-cores in graphics processor 3300, for example, in lower performanceand/or lower power graphics processor implementations. In at least oneembodiment, geometry/fixed function pipeline 3336 includes a 3D fixedfunction pipeline, a video front-end unit, a thread spawner and threaddispatcher, and a unified return buffer manager, which manages unifiedreturn buffers.

In at least one embodiment fixed function block 3330 also includes agraphics SoC interface 3337, a graphics microcontroller 3338, and amedia pipeline 3339. Graphics SoC interface 3337 provides an interfacebetween graphics core 3300 and other processor cores within a system ona chip integrated circuit. In at least one embodiment, graphicsmicrocontroller 3338 is a programmable sub-processor that isconfigurable to manage various functions of graphics processor 3300,including thread dispatch, scheduling, and pre-emption. In at least oneembodiment, media pipeline 3339 includes logic to facilitate decoding,encoding, pre-processing, and/or post-processing of multimedia data,including image and video data. In at least one embodiment, mediapipeline 3339 implement media operations via requests to compute orsampling logic within sub-cores 3301-3301F.

In at least one embodiment, SoC interface 3337 enables graphics core3300 to communicate with general-purpose application processor cores(e.g., CPUs) and/or other components within an SoC, including memoryhierarchy elements such as a shared last level cache memory, system RAM,and/or embedded on-chip or on-package DRAM. In at least one embodiment,SoC interface 3337 can also enable communication with fixed functiondevices within an SoC, such as camera imaging pipelines, and enables useof and/or implements global memory atomics that may be shared betweengraphics core 3300 and CPUs within an SoC. In at least one embodiment,SoC interface 3337 can also implement power management controls forgraphics core 3300 and enable an interface between a clock domain ofgraphic core 3300 and other clock domains within an SoC. In at least oneembodiment, SoC interface 3337 enables receipt of command buffers from acommand streamer and global thread dispatcher that are configured toprovide commands and instructions to each of one or more graphics coreswithin a graphics processor. In at least one embodiment, commands andinstructions can be dispatched to media pipeline 3339, when mediaoperations are to be performed, or a geometry and fixed functionpipeline (e.g., geometry and fixed function pipeline 3336, geometry andfixed function pipeline 3314) when graphics processing operations are tobe performed.

In at least one embodiment, graphics microcontroller 3338 can beconfigured to perform various scheduling and management tasks forgraphics core 3300. In at least one embodiment, graphics microcontroller3338 can perform graphics and/or compute workload scheduling on variousgraphics parallel engines within execution unit (EU) arrays 3302A-3302F,3304A-3304F within sub-cores 3301A-3301F. In at least one embodiment,host software executing on a CPU core of an SoC including graphics core3300 can submit workloads one of multiple graphic processor doorbells,which invokes a scheduling operation on an appropriate graphics engine.In at least one embodiment, scheduling operations include determiningwhich workload to run next, submitting a workload to a command streamer,pre-empting existing workloads running on an engine, monitoring progressof a workload, and notifying host software when a workload is complete.In at least one embodiment, graphics microcontroller 3338 can alsofacilitate low-power or idle states for graphics core 3300, providinggraphics core 3300 with an ability to save and restore registers withingraphics core 3300 across low-power state transitions independently froman operating system and/or graphics driver software on a system.

In at least one embodiment, graphics core 3300 may have greater than orfewer than illustrated sub-cores 3301A-3301F, up to N modular sub-cores.For each set of N sub-cores, in at least one embodiment, graphics core3300 can also include shared function logic 3310, shared and/or cachememory 3312, a geometry/fixed function pipeline 3314, as well asadditional fixed function logic 3316 to accelerate various graphics andcompute processing operations. In at least one embodiment, sharedfunction logic 3310 can include logic units (e.g., sampler, math, and/orinter-thread communication logic) that can be shared by each N sub-coreswithin graphics core 3300. Shared and/or cache memory 3312 can be alast-level cache for N sub-cores 3301A-3301F within graphics core 3300and can also serve as shared memory that is accessible by multiplesub-cores. In at least one embodiment, geometry/fixed function pipeline3314 can be included instead of geometry/fixed function pipeline 3336within fixed function block 3330 and can include same or similar logicunits.

In at least one embodiment, graphics core 3300 includes additional fixedfunction logic 3316 that can include various fixed function accelerationlogic for use by graphics core 3300. In at least one embodiment,additional fixed function logic 3316 includes an additional geometrypipeline for use in position only shading. In position-only shading, atleast two geometry pipelines exist, whereas in a full geometry pipelinewithin geometry/fixed function pipeline 3316, 3336, and a cull pipeline,which is an additional geometry pipeline which may be included withinadditional fixed function logic 3316. In at least one embodiment, cullpipeline is a trimmed down version of a full geometry pipeline. In atleast one embodiment, a full pipeline and a cull pipeline can executedifferent instances of an application, each instance having a separatecontext. In at least one embodiment, position only shading can hide longcull runs of discarded triangles, enabling shading to be completedearlier in some instances. For example, in at least one embodiment, cullpipeline logic within additional fixed function logic 3316 can executeposition shaders in parallel with a main application and generallygenerates critical results faster than a full pipeline, as cull pipelinefetches and shades position attribute of vertices, without performingrasterization and rendering of pixels to a frame buffer. In at least oneembodiment, cull pipeline can use generated critical results to computevisibility information for all triangles without regard to whether thosetriangles are culled. In at least one embodiment, full pipeline (whichin this instance may be referred to as a replay pipeline) can consumevisibility information to skip culled triangles to shade only visibletriangles that are finally passed to a rasterization phase.

In at least one embodiment, additional fixed function logic 3316 canalso include machine-learning acceleration logic, such as fixed functionmatrix multiplication logic, for implementations including optimizationsfor machine learning training or inferencing.

In at least one embodiment, within each graphics sub-core 3301A-3301Fincludes a set of execution resources that may be used to performgraphics, media, and compute operations in response to requests bygraphics pipeline, media pipeline, or shader programs. In at least oneembodiment, graphics sub-cores 3301A-3301F include multiple EU arrays3302A-3302F, 3304A-3304F, thread dispatch and inter-thread communication(TD/IC) logic 3303A-3303F, a 3D (e.g., texture) sampler 3305A-3305F, amedia sampler 3306A-3306F, a shader processor 3307A-3307F, and sharedlocal memory (SLM) 3308A-3308F. EU arrays 3302A-3302F, 3304A-3304F eachinclude multiple execution units, which are general-purpose graphicsprocessing units capable of performing floating-point andinteger/fixed-point logic operations in service of a graphics, media, orcompute operation, including graphics, media, or compute shaderprograms. In at least one embodiment, TD/IC logic 3303A-3303F performslocal thread dispatch and thread control operations for execution unitswithin a sub-core and facilitate communication between threads executingon execution units of a sub-core. In at least one embodiment, 3D sampler3305A-3305F can read texture or other 3D graphics related data intomemory. In at least one embodiment, 3D sampler can read texture datadifferently based on a configured sample state and texture formatassociated with a given texture. In at least one embodiment, mediasampler 3306A-3306F can perform similar read operations based on a typeand format associated with media data. In at least one embodiment, eachgraphics sub-core 3301A-3301F can alternately include a unified 3D andmedia sampler. In at least one embodiment, threads executing onexecution units within each of sub-cores 3301A-3301F can make use ofshared local memory 3308A-3308F within each sub-core, to enable threadsexecuting within a thread group to execute using a common pool ofon-chip memory.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, portions or all of inference and/or training logic 1015 maybe incorporated into graphics processor 3310. For example, in at leastone embodiment, training and/or inferencing techniques described hereinmay use one or more of ALUs embodied in 3D pipeline 3310, graphicsmicrocontroller 3338, geometry & fixed function pipeline 3314 and 3336,or other logic in FIG. 30. Moreover, in at least one embodiment,inferencing and/or training operations described herein may be doneusing logic other than logic illustrated in FIG. 10A or 10B. In at leastone embodiment, weight parameters may be stored in on-chip or off-chipmemory and/or registers (shown or not shown) that configure ALUs ofgraphics processor 3300 to perform one or more machine learningalgorithms, neural network architectures, use cases, or trainingtechniques described herein.

FIGS. 34A-34B illustrate thread execution logic 3400 including an arrayof processing elements of a graphics processor core according to atleast one embodiment. FIG. 34A illustrates at least one embodiment, inwhich thread execution logic 3400 is used. FIG. 34B illustratesexemplary internal details of an execution unit, according to at leastone embodiment.

As illustrated in FIG. 34A, in at least one embodiment, thread executionlogic 3400 includes a shader processor 3402, a thread dispatcher 3404,instruction cache 3406, a scalable execution unit array including aplurality of execution units 3408A-3408N, a sampler 3410, a data cache3412, and a data port 3414. In at least one embodiment a scalableexecution unit array can dynamically scale by enabling or disabling oneor more execution units (e.g., any of execution unit 3408A, 3408B,3408C, 3408D, through 3408N-1 and 3408N) based on computationalrequirements of a workload, for example. In at least one embodiment,scalable execution units are interconnected via an interconnect fabricthat links to each of execution unit. In at least one embodiment, threadexecution logic 3400 includes one or more connections to memory, such assystem memory or cache memory, through one or more of instruction cache3406, data port 3414, sampler 3410, and execution units 3408A-3408N. Inat least one embodiment, each execution unit (e.g., 3408A) is astand-alone programmable general-purpose computational unit that iscapable of executing multiple simultaneous hardware threads whileprocessing multiple data elements in parallel for each thread. In atleast one embodiment, array of execution units 3408A-3408N is scalableto include any number individual execution units.

In at least one embodiment, execution units 3408A-3408N are primarilyused to execute shader programs. In at least one embodiment, shaderprocessor 3402 can process various shader programs and dispatchexecution threads associated with shader programs via a threaddispatcher 3404. In at least one embodiment, thread dispatcher 3404includes logic to arbitrate thread initiation requests from graphics andmedia pipelines and instantiate requested threads on one or moreexecution units in execution units 3408A-3408N. For example, in at leastone embodiment, a geometry pipeline can dispatch vertex, tessellation,or geometry shaders to thread execution logic for processing. In atleast one embodiment, thread dispatcher 3404 can also process runtimethread spawning requests from executing shader programs.

In at least one embodiment, execution units 3408A-3408N support aninstruction set that includes native support for many standard 3Dgraphics shader instructions, such that shader programs from graphicslibraries (e.g., Direct 3D and OpenGL) are executed with a minimaltranslation. In at least one embodiment, execution units support vertexand geometry processing (e.g., vertex programs, geometry programs,vertex shaders), pixel processing (e.g., pixel shaders, fragmentshaders) and general-purpose processing (e.g., compute and mediashaders). In at least one embodiment, each of execution units3408A-3408N, which include one or more arithmetic logic units (ALUs), iscapable of multi-issue single instruction multiple data (SIMD) executionand multi-threaded operation enables an efficient execution environmentdespite higher latency memory accesses. In at least one embodiment, eachhardware thread within each execution unit has a dedicatedhigh-bandwidth register file and associated independent thread-state. Inat least one embodiment, execution is multi-issue per clock to pipelinescapable of integer, single and double precision floating pointoperations, SIMD branch capability, logical operations, transcendentaloperations, and other miscellaneous operations. In at least oneembodiment, while waiting for data from memory or one of sharedfunctions, dependency logic within execution units 3408A-3408N causes awaiting thread to sleep until requested data has been returned. In atleast one embodiment, while a waiting thread is sleeping, hardwareresources may be devoted to processing other threads. For example, in atleast one embodiment, during a delay associated with a vertex shaderoperation, an execution unit can perform operations for a pixel shader,fragment shader, or another type of shader program, including adifferent vertex shader.

In at least one embodiment, each execution unit in execution units3408A-3408N operates on arrays of data elements. In at least oneembodiment, a number of data elements is “execution size,” or number ofchannels for an instruction. In at least one embodiment, an executionchannel is a logical unit of execution for data element access, masking,and flow control within instructions. In at least one embodiment, anumber of channels may be independent of a number of physical ArithmeticLogic Units (ALUs) or Floating Point Units (FPUs) for a particulargraphics processor. In at least one embodiment, execution units3408A-3408N support integer and floating-point data types.

In at least one embodiment, an execution unit instruction set includesSIMD instructions. In at least one embodiment, various data elements canbe stored as a packed data type in a register and execution unit willprocess various elements based on data size of elements. For example, inat least one embodiment, when operating on a 256-bit wide vector, 256bits of a vector are stored in a register and an execution unit operateson a vector as four separate 64-bit packed data elements (Quad-Word (QW)size data elements), eight separate 32-bit packed data elements (DoubleWord (DW) size data elements), sixteen separate 16-bit packed dataelements (Word (W) size data elements), or thirty-two separate 8-bitdata elements (byte (B) size data elements). However, in at least oneembodiment, different vector widths and register sizes are possible.

In at least one embodiment, one or more execution units can be combinedinto a fused execution unit 3409A-3409N having thread control logic(3407A-3407N) that is common to fused EUs. In at least one embodiment,multiple EUs can be fused into an EU group. In at least one embodiment,each EU in fused EU group can be configured to execute a separate SIMDhardware thread. A number of EUs in a fused EU group can vary accordingto various embodiments. In at least one embodiment, various SIMD widthscan be performed per-EU, including but not limited to SIMD8, SIMD16, andSIMD32. In at least one embodiment, each fused graphics execution unit3409A-3409N includes at least two execution units. For example, in atleast one embodiment, fused execution unit 3409A includes a first EU3408A, second EU 3408B, and thread control logic 3407A that is common tofirst EU 3408A and second EU 3408B. In at least one embodiment, threadcontrol logic 3407A controls threads executed on fused graphicsexecution unit 3409A, allowing each EU within fused execution units3409A-3409N to execute using a common instruction pointer register.

In at least one embodiment, one or more internal instruction caches(e.g., 3406) are included in thread execution logic 3400 to cache threadinstructions for execution units. In at least one embodiment, one ormore data caches (e.g., 3412) are included to cache thread data duringthread execution. In at least one embodiment, a sampler 3410 is includedto provide texture sampling for 3D operations and media sampling formedia operations. In at least one embodiment, sampler 3410 includesspecialized texture or media sampling functionality to process textureor media data during sampling process before providing sampled data toan execution unit.

During execution, in at least one embodiment, graphics and mediapipelines send thread initiation requests to thread execution logic 3400via thread spawning and dispatch logic. In at least one embodiment, oncea group of geometric objects has been processed and rasterized intopixel data, pixel processor logic (e.g., pixel shader logic, fragmentshader logic, etc.) within shader processor 3402 is invoked to furthercompute output information and cause results to be written to outputsurfaces (e.g., color buffers, depth buffers, stencil buffers, etc.). Inat least one embodiment, a pixel shader or fragment shader calculatesvalues of various vertex attributes that are to be interpolated across arasterized object. In at least one embodiment, pixel processor logicwithin shader processor 3402 then executes an application programminginterface (API)-supplied pixel or fragment shader program. In at leastone embodiment, to execute a shader program, shader processor 3402dispatches threads to an execution unit (e.g., 3408A) via threaddispatcher 3404. In at least one embodiment, shader processor 3402 usestexture sampling logic in sampler 3410 to access texture data in texturemaps stored in memory. In at least one embodiment, arithmetic operationson texture data and input geometry data compute pixel color data foreach geometric fragment, or discards one or more pixels from furtherprocessing.

In at least one embodiment, data port 3414 provides a memory accessmechanism for thread execution logic 3400 to output processed data tomemory for further processing on a graphics processor output pipeline.In at least one embodiment, data port 3414 includes or couples to one ormore cache memories (e.g., data cache 3412) to cache data for memoryaccess via a data port.

As illustrated in FIG. 34B, in at least one embodiment, a graphicsexecution unit 3408 can include an instruction fetch unit 3437, ageneral register file array (GRF) 3424, an architectural register filearray (ARF) 3426, a thread arbiter 3422, a send unit 3430, a branch unit3432, a set of SIMD floating point units (FPUs) 3434, and In at leastone embodiment a set of dedicated integer SIMD ALUs 3435. In at leastone embodiment, GRF 3424 and ARF 3426 includes a set of general registerfiles and architecture register files associated with each simultaneoushardware thread that may be active in graphics execution unit 3408. Inat least one embodiment, per thread architectural state is maintained inARF 3426, while data used during thread execution is stored in GRF 3424.In at least one embodiment, execution state of each thread, includinginstruction pointers for each thread, can be held in thread-specificregisters in ARF 3426.

In at least one embodiment, graphics execution unit 3408 has anarchitecture that is a combination of Simultaneous Multi-Threading (SMT)and fine-grained Interleaved Multi-Threading (IMT). In at least oneembodiment, architecture has a modular configuration that can befine-tuned at design time based on a target number of simultaneousthreads and number of registers per execution unit, where execution unitresources are divided across logic used to execute multiple simultaneousthreads.

In at least one embodiment, graphics execution unit 3408 can co-issuemultiple instructions, which may each be different instructions. In atleast one embodiment, thread arbiter 3422 of graphics execution unitthread 3408 can dispatch instructions to one of send unit 3430, branchunit 3442, or SIMD FPU(s) 3434 for execution. In at least oneembodiment, each execution thread can access 128 general-purposeregisters within GRF 3424, where each register can store 32 bytes,accessible as a SIMD 8-element vector of 32-bit data elements. In atleast one embodiment, each execution unit thread has access to 4 Kbyteswithin GRF 3424, although embodiments are not so limited, and greater orfewer register resources may be provided in other embodiments. In atleast one embodiment, up to seven threads can execute simultaneously,although a number of threads per execution unit can also vary accordingto embodiments. In at least one embodiment, in which seven threads mayaccess 4 Kbytes, GRF 3424 can store a total of 28 Kbytes. In at leastone embodiment, flexible addressing modes can permit registers to beaddressed together to build effectively wider registers or to representstrided rectangular block data structures.

In at least one embodiment, memory operations, sampler operations, andother longer-latency system communications are dispatched via “send”instructions that are executed by message passing send unit 3430. In atleast one embodiment, branch instructions are dispatched to a dedicatedbranch unit 3432 to facilitate SIMD divergence and eventual convergence.

In at least one embodiment graphics execution unit 3408 includes one ormore SIMD floating point units (FPU(s)) 3434 to perform floating-pointoperations. In at least one embodiment, FPU(s) 3434 also support integercomputation. In at least one embodiment FPU(s) 3434 can SIMD execute upto M number of 32-bit floating-point (or integer) operations, or SIMDexecute up to 2M 16-bit integer or 16-bit floating-point operations. Inat least one embodiment, at least one of FPU(s) provides extended mathcapability to support high-throughput transcendental math functions anddouble precision 64-bit floating-point. In at least one embodiment, aset of 8-bit integer SIMD ALUs 3435 are also present, and may bespecifically optimized to perform operations associated with machinelearning computations.

In at least one embodiment, arrays of multiple instances of graphicsexecution unit 3408 can be instantiated in a graphics sub-core grouping(e.g., a sub-slice). In at least one embodiment execution unit 3408 canexecute instructions across a plurality of execution channels. In atleast one embodiment, each thread executed on graphics execution unit3408 is executed on a different channel.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, portions or all of inference and/or training logic 1015 maybe incorporated into execution logic 3400. Moreover, in at least oneembodiment, inferencing and/or training operations described herein maybe done using logic other than logic illustrated in FIG. 10A or 10B. Inat least one embodiment, weight parameters may be stored in on-chip oroff-chip memory and/or registers (shown or not shown) that configureALUs of execution logic 3400 to perform one or more machine learningalgorithms, neural network architectures, use cases, or trainingtechniques described herein.

FIG. 35 illustrates a parallel processing unit (“PPU”) 3500, accordingto at least one embodiment. In at least one embodiment, PPU 3500 isconfigured with machine-readable code that, if executed by PPU 3500,causes PPU 3500 to perform some or all of processes and techniquesdescribed throughout this disclosure. In at least one embodiment, PPU3500 is a multi-threaded processor that is implemented on one or moreintegrated circuit devices and that utilizes multithreading as alatency-hiding technique designed to process computer-readableinstructions (also referred to as machine-readable instructions orsimply instructions) on multiple threads in parallel. In at least oneembodiment, a thread refers to a thread of execution and is aninstantiation of a set of instructions configured to be executed by PPU3500. In at least one embodiment, PPU 3500 is a graphics processing unit(“GPU”) configured to implement a graphics rendering pipeline forprocessing three-dimensional (“3D”) graphics data in order to generatetwo-dimensional (“2D”) image data for display on a display device suchas a liquid crystal display (“LCD”) device. In at least one embodiment,PPU 3500 is utilized to perform computations such as linear algebraoperations and machine-learning operations. FIG. 35 illustrates anexample parallel processor for illustrative purposes only and should beconstrued as a non-limiting example of processor architecturescontemplated within scope of this disclosure and that any suitableprocessor may be employed to supplement and/or substitute for same.

In at least one embodiment, one or more PPUs 3500 are configured toaccelerate High Performance Computing (“HPC”), data center, and machinelearning applications. In at least one embodiment, PPU 3500 isconfigured to accelerate deep learning systems and applicationsincluding following non-limiting examples: autonomous vehicle platforms,deep learning, high-accuracy speech, image, text recognition systems,intelligent video analytics, molecular simulations, drug discovery,disease diagnosis, weather forecasting, big data analytics, astronomy,molecular dynamics simulation, financial modeling, robotics, factoryautomation, real-time language translation, online search optimizations,and personalized user recommendations, and more.

In at least one embodiment, PPU 3500 includes, without limitation, anInput/Output (“I/O”) unit 3506, a front-end unit 3510, a scheduler unit3512, a work distribution unit 3514, a hub 3516, a crossbar (“Xbar”)3520, one or more general processing clusters (“GPCs”) 3518, and one ormore partition units (“memory partition units”) 3522. In at least oneembodiment, PPU 3500 is connected to a host processor or other PPUs 3500via one or more high-speed GPU interconnects (“GPU interconnects”) 3508.In at least one embodiment, PPU 3500 is connected to a host processor orother peripheral devices via an interconnect 3502. In at least oneembodiment, PPU 3500 is connected to a local memory comprising one ormore memory devices (“memory”) 3504. In at least one embodiment, memorydevices 3504 include, without limitation, one or more dynamic randomaccess memory (“DRAM”) devices. In at least one embodiment, one or moreDRAM devices are configured and/or configurable as high-bandwidth memory(“HBM”) subsystems, with multiple DRAM dies stacked within each device.

In at least one embodiment, high-speed GPU interconnect 3508 may referto a wire-based multi-lane communications link that is used by systemsto scale and include one or more PPUs 3500 combined with one or morecentral processing units (“CPUs”), supports cache coherence between PPUs3500 and CPUs, and CPU mastering. In at least one embodiment, dataand/or commands are transmitted by high-speed GPU interconnect 3508through hub 3516 to/from other units of PPU 3500 such as one or morecopy engines, video encoders, video decoders, power management units,and other components which may not be explicitly illustrated in FIG. 35.

In at least one embodiment, I/O unit 3506 is configured to transmit andreceive communications (e.g., commands, data) from a host processor (notillustrated in FIG. 35) over system bus 3502. In at least oneembodiment, I/O unit 3506 communicates with host processor directly viasystem bus 3502 or through one or more intermediate devices such as amemory bridge. In at least one embodiment, I/O unit 3506 may communicatewith one or more other processors, such as one or more of PPUs 3500 viasystem bus 3502. In at least one embodiment, I/O unit 3506 implements aPeripheral Component Interconnect Express (“PCIe”) interface forcommunications over a PCIe bus. In at least one embodiment, I/O unit3506 implements interfaces for communicating with external devices.

In at least one embodiment, I/O unit 3506 decodes packets received viasystem bus 3502. In at least one embodiment, at least some packetsrepresent commands configured to cause PPU 3500 to perform variousoperations. In at least one embodiment, I/O unit 3506 transmits decodedcommands to various other units of PPU 3500 as specified by commands. Inat least one embodiment, commands are transmitted to front-end unit 3510and/or transmitted to hub 3516 or other units of PPU 3500 such as one ormore copy engines, a video encoder, a video decoder, a power managementunit, etc. (not explicitly illustrated in FIG. 35). In at least oneembodiment, I/O unit 3506 is configured to route communications betweenand among various logical units of PPU 3500.

In at least one embodiment, a program executed by host processor encodesa command stream in a buffer that provides workloads to PPU 3500 forprocessing. In at least one embodiment, a workload comprisesinstructions and data to be processed by those instructions. In at leastone embodiment, buffer is a region in a memory that is accessible (e.g.,read/write) by both host processor and PPU 3500—a host interface unitmay be configured to access buffer in a system memory connected tosystem bus 3502 via memory requests transmitted over system bus 3502 byI/O unit 3506. In at least one embodiment, host processor writes commandstream to buffer and then transmits a pointer to start of command streamto PPU 3500 such that front-end unit 3510 receives pointers to one ormore command streams and manages one or more command streams, readingcommands from command streams and forwarding commands to various unitsof PPU 3500.

In at least one embodiment, front-end unit 3510 is coupled to schedulerunit 3512 that configures various GPCs 3518 to process tasks defined byone or more command streams. In at least one embodiment, scheduler unit3512 is configured to track state information related to various tasksmanaged by scheduler unit 3512 where state information may indicatewhich of GPCs 3518 a task is assigned to, whether task is active orinactive, a priority level associated with task, and so forth. In atleast one embodiment, scheduler unit 3512 manages execution of aplurality of tasks on one or more of GPCs 3518.

In at least one embodiment, scheduler unit 3512 is coupled to workdistribution unit 3514 that is configured to dispatch tasks forexecution on GPCs 3518. In at least one embodiment, work distributionunit 3514 tracks a number of scheduled tasks received from schedulerunit 3512 and work distribution unit 3514 manages a pending task pooland an active task pool for each of GPCs 3518. In at least oneembodiment, pending task pool comprises a number of slots (e.g., 32slots) that contain tasks assigned to be processed by a particular GPC3518; active task pool may comprise a number of slots (e.g., 4 slots)for tasks that are actively being processed by GPCs 3518 such that asone of GPCs 3518 completes execution of a task, that task is evictedfrom active task pool for GPC 3518 and one of other tasks from pendingtask pool is selected and scheduled for execution on GPC 3518. In atleast one embodiment, if an active task is idle on GPC 3518, such aswhile waiting for a data dependency to be resolved, then active task isevicted from GPC 3518 and returned to pending task pool while anothertask in pending task pool is selected and scheduled for execution on GPC3518.

In at least one embodiment, work distribution unit 3514 communicateswith one or more GPCs 3518 via XBar 3520. In at least one embodiment,XBar 3520 is an interconnect network that couples many of units of PPU3500 to other units of PPU 3500 and can be configured to couple workdistribution unit 3514 to a particular GPC 3518. In at least oneembodiment, one or more other units of PPU 3500 may also be connected toXBar 3520 via hub 3516.

In at least one embodiment, tasks are managed by scheduler unit 3512 anddispatched to one of GPCs 3518 by work distribution unit 3514. GPC 3518is configured to process task and generate results. In at least oneembodiment, results may be consumed by other tasks within GPC 3518,routed to a different GPC 3518 via XBar 3520, or stored in memory 3504.In at least one embodiment, results can be written to memory 3504 viapartition units 3522, which implement a memory interface for reading andwriting data to/from memory 3504. In at least one embodiment, resultscan be transmitted to another PPU 3504 or CPU via high-speed GPUinterconnect 3508. In at least one embodiment, PPU 3500 includes,without limitation, a number U of partition units 3522 that is equal tonumber of separate and distinct memory devices 3504 coupled to PPU 3500.In at least one embodiment, partition unit 3522 will be described inmore detail herein in conjunction with FIG. 37.

In at least one embodiment, a host processor executes a driver kernelthat implements an application programming interface (“API”) thatenables one or more applications executing on host processor to scheduleoperations for execution on PPU 3500. In at least one embodiment,multiple compute applications are simultaneously executed by PPU 3500and PPU 3500 provides isolation, quality of service (“QoS”), andindependent address spaces for multiple compute applications. In atleast one embodiment, an application generates instructions (e.g., inform of API calls) that cause driver kernel to generate one or moretasks for execution by PPU 3500 and driver kernel outputs tasks to oneor more streams being processed by PPU 3500. In at least one embodiment,each task comprises one or more groups of related threads, which may bereferred to as a warp. In at least one embodiment, a warp comprises aplurality of related threads (e.g., 32 threads) that can be executed inparallel. In at least one embodiment, cooperating threads can refer to aplurality of threads including instructions to perform task and thatexchange data through shared memory. In at least one embodiment, threadsand cooperating threads are described in more detail, in accordance withat least one embodiment, in conjunction with FIG. 37.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, deep learning application processor is used to train amachine learning model, such as a neural network, to predict or inferinformation provided to PPU 3500. In at least one embodiment, deeplearning application processor 3500 is used to infer or predictinformation based on a trained machine learning model (e.g., neuralnetwork) that has been trained by another processor or system or by PPU3500. In at least one embodiment, PPU 3500 may be used to perform one ormore neural network use cases described herein.

FIG. 36 illustrates a general processing cluster (“GPC”) 3600, accordingto at least one embodiment. In at least one embodiment, GPC 3600 is GPC3518 of FIG. 35. In at least one embodiment, each GPC 3600 includes,without limitation, a number of hardware units for processing tasks andeach GPC 3600 includes, without limitation, a pipeline manager 3602, apre-raster operations unit (“PROP”) 3604, a raster engine 3608, a workdistribution crossbar (“WDX”) 3616, a memory management unit (“MMU”)3618, one or more Data Processing Clusters (“DPCs”) 3606, and anysuitable combination of parts.

In at least one embodiment, operation of GPC 3600 is controlled bypipeline manager 3602. In at least one embodiment, pipeline manager 3602manages configuration of one or more DPCs 3606 for processing tasksallocated to GPC 3600. In at least one embodiment, pipeline manager 3602configures at least one of one or more DPCs 3606 to implement at least aportion of a graphics rendering pipeline. In at least one embodiment,DPC 3606 is configured to execute a vertex shader program on aprogrammable streaming multi-processor (“SM”) 3614. In at least oneembodiment, pipeline manager 3602 is configured to route packetsreceived from a work distribution unit to appropriate logical unitswithin GPC 3600, in at least one embodiment, and some packets may berouted to fixed function hardware units in PROP 3604 and/or rasterengine 3608 while other packets may be routed to DPCs 3606 forprocessing by a primitive engine 3612 or SM 3614. In at least oneembodiment, pipeline manager 3602 configures at least one of DPCs 3606to implement a neural network model and/or a computing pipeline.

In at least one embodiment, PROP unit 3604 is configured, in at leastone embodiment, to route data generated by raster engine 3608 and DPCs3606 to a Raster Operations (“ROP”) unit in partition unit 3522,described in more detail above in conjunction with FIG. 35. In at leastone embodiment, PROP unit 3604 is configured to perform optimizationsfor color blending, organize pixel data, perform address translations,and more. In at least one embodiment, raster engine 3608 includes,without limitation, a number of fixed function hardware units configuredto perform various raster operations, in at least one embodiment, andraster engine 3608 includes, without limitation, a setup engine, acoarse raster engine, a culling engine, a clipping engine, a fine rasterengine, a tile coalescing engine, and any suitable combination thereof.In at least one embodiment, setup engine receives transformed verticesand generates plane equations associated with geometric primitivedefined by vertices; plane equations are transmitted to coarse rasterengine to generate coverage information (e.g., an x, y coverage mask fora tile) for primitive; output of coarse raster engine is transmitted toculling engine where fragments associated with primitive that fail az-test are culled, and transmitted to a clipping engine where fragmentslying outside a viewing frustum are clipped. In at least one embodiment,fragments that survive clipping and culling are passed to fine rasterengine to generate attributes for pixel fragments based on planeequations generated by setup engine. In at least one embodiment, outputof raster engine 3608 comprises fragments to be processed by anysuitable entity such as by a fragment shader implemented within DPC3606.

In at least one embodiment, each DPC 3606 included in GPC 3600 comprise,without limitation, an M-Pipe Controller (“MPC”) 3610; primitive engine3612; one or more SMs 3614; and any suitable combination thereof. In atleast one embodiment, MPC 3610 controls operation of DPC 3606, routingpackets received from pipeline manager 3602 to appropriate units in DPC3606. In at least one embodiment, packets associated with a vertex arerouted to primitive engine 3612, which is configured to fetch vertexattributes associated with vertex from memory; in contrast, packetsassociated with a shader program may be transmitted to SM 3614.

In at least one embodiment, SM 3614 comprises, without limitation, aprogrammable streaming processor that is configured to process tasksrepresented by a number of threads. In at least one embodiment, SM 3614is multi-threaded and configured to execute a plurality of threads(e.g., 32 threads) from a particular group of threads concurrently andimplements a Single-Instruction, Multiple-Data (“SIMD”) architecturewhere each thread in a group of threads (e.g., a warp) is configured toprocess a different set of data based on same set of instructions. In atleast one embodiment, all threads in group of threads execute sameinstructions. In at least one embodiment, SM 3614 implements aSingle-Instruction, Multiple Thread (“SIMT”) architecture wherein eachthread in a group of threads is configured to process a different set ofdata based on same set of instructions, but where individual threads ingroup of threads are allowed to diverge during execution. In at leastone embodiment, a program counter, call stack, and execution state ismaintained for each warp, enabling concurrency between warps and serialexecution within warps when threads within warp diverge. In anotherembodiment, a program counter, call stack, and execution state ismaintained for each individual thread, enabling equal concurrencybetween all threads, within and between warps. In at least oneembodiment, execution state is maintained for each individual thread andthreads executing same instructions may be converged and executed inparallel for better efficiency. At least one embodiment of SM 3614 aredescribed in more detail herein.

In at least one embodiment, MMU 3618 provides an interface between GPC3600 and memory partition unit (e.g., partition unit 3522 of FIG. 35)and MMU 3618 provides translation of virtual addresses into physicaladdresses, memory protection, and arbitration of memory requests. In atleast one embodiment, MMU 3618 provides one or more translationlookaside buffers (“TLBs”) for performing translation of virtualaddresses into physical addresses in memory.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, deep learning application processor is used to train amachine learning model, such as a neural network, to predict or inferinformation provided to GPC 3600. In at least one embodiment, GPC 3600is used to infer or predict information based on a trained machinelearning model (e.g., neural network) that has been trained by anotherprocessor or system or by GPC 3600. In at least one embodiment, GPC 3600may be used to perform one or more neural network use cases describedherein.

FIG. 37 illustrates a memory partition unit 3700 of a parallelprocessing unit (“PPU”), in a37ordance with at least one embodiment. Inat least one embodiment, memory partition unit 3700 includes, withoutlimitation, a Raster Operations (“ROP”) unit 3702; a level two (“L2”)cache 3704; a memory interface 3706; and any suitable combinationthereof. Memory interface 3706 is coupled to memory. Memory interface3706 may implement 32, 64, 128, 1024-bit data buses, or like, forhigh-speed data transfer. In at least one embodiment, PPU incorporates Umemory interfaces 3706, one memory interface 3706 per pair of partitionunits 3700, where each pair of partition units 3700 is connected to acorresponding memory device. For example, in at least one embodiment,PPU may be connected to up to Y memory devices, such as high bandwidthmemory stacks or graphics double-data-rate, version 5, synchronousdynamic random a37ess memory (“GDDR5 SDRAM”).

In at least one embodiment, memory interface 3706 implements a highbandwidth memory second generation (“HBM2”) memory interface and Yequals half U. In at least one embodiment, HBM2 memory stacks arelocated on same physical package as PPU, providing substantial power andarea savings compared with conventional GDDR5 SDRAM systems. In at leastone embodiment, each HBM2 stack includes, without limitation, fourmemory dies and Y equals 4, with each HBM2 stack including two 128-bitchannels per die for a total of 8 channels and a data bus width of 1024bits. In at least one embodiment, memory supports Single-ErrorCorrecting Double-Error Detecting (“SECDED”) Error Correction Code(“ECC”) to protect data. ECC provides higher reliability for computeapplications that are sensitive to data corruption.

In at least one embodiment, PPU implements a multi-level memoryhierarchy. In at least one embodiment, memory partition unit 3700supports a unified memory to provide a single unified virtual addressspace for central processing unit (“CPU”) and PPU memory, enabling datasharing between virtual memory systems. In at least one embodimentfrequency of a37esses by a PPU to memory located on other processors istraced to ensure that memory pages are moved to physical memory of PPUthat is a37essing pages more frequently. In at least one embodiment,high-speed GPU interconnect 3508 supports address translation servicesallowing PPU to directly a37ess a CPU's page tables and providing fulla37ess to CPU memory by PPU.

In at least one embodiment, copy engines transfer data between multiplePPUs or between PPUs and CPUs. In at least one embodiment, copy enginescan generate page faults for addresses that are not mapped into pagetables and memory partition unit 3700 then services page faults, mappingaddresses into page table, after which copy engine performs transfer. Inat least one embodiment, memory is pinned (i.e., non-pageable) formultiple copy engine operations between multiple processors,substantially reducing available memory. In at least one embodiment,with hardware page faulting, addresses can be passed to copy engineswithout regard as to whether memory pages are resident, and copy processis transparent.

Data from memory 3504 of FIG. 35 or other system memory is fetched bymemory partition unit 3700 and stored in L2 cache 3704, which is locatedon-chip and is shared between various GPCs, in a37ordance with at leastone embodiment. Each memory partition unit 3700, in at least oneembodiment, includes, without limitation, at least a portion of L2 cacheassociated with a corresponding memory device. In at least oneembodiment, lower level caches are implemented in various units withinGPCs. In at least one embodiment, each of SMs 3614 may implement a levelone (“L1”) cache wherein L1 cache is private memory that is dedicated toa particular SM 3614 and data from L2 cache 3704 is fetched and storedin each of L1 caches for processing in functional units of SMs 3614. Inat least one embodiment, L2 cache 3704 is coupled to memory interface3706 and XBar 3520.

ROP unit 3702 performs graphics raster operations related to pixelcolor, such as color compression, pixel blending, and more, in at leastone embodiment. ROP unit 3702, in at least one embodiment, implementsdepth testing in conjunction with raster engine 3608, receiving a depthfor a sample location associated with a pixel fragment from cullingengine of raster engine 3608. In at least one embodiment, depth istested against a corresponding depth in a depth buffer for a samplelocation associated with fragment. In at least one embodiment, iffragment passes depth test for sample location, then ROP unit 3702updates depth buffer and transmits a result of depth test to rasterengine 3608. It will be appreciated that number of partition units 3700may be different than number of GPCs and, therefore, each ROP unit 3702can, in at least one embodiment, be coupled to each of GPCs. In at leastone embodiment, ROP unit 3702 tracks packets received from differentGPCs and determines which that a result generated by ROP unit 3702 isrouted to through XBar 3520.

FIG. 38 illustrates a streaming multi-processor (“SM”) 3800, accordingto at least one embodiment. In at least one embodiment, SM 3800 is SM ofFIG. 36. In at least one embodiment, SM 3800 includes, withoutlimitation, an instruction cache 3802; one or more scheduler units 3804;a register file 3808; one or more processing cores (“cores”) 3810; oneor more special function units (“SFUs”) 3812; one or more load/storeunits (“LSUs”) 3814; an interconnect network 3816; a shared memory/levelone (“L1”) cache 3818; and any suitable combination thereof. In at leastone embodiment, a work distribution unit dispatches tasks for executionon general processing clusters (“GPCs”) of parallel processing units(“PPUs”) and each task is allocated to a particular Data ProcessingCluster (“DPC”) within a GPC and, if task is associated with a shaderprogram, task is allocated to one of SMs 3800. In at least oneembodiment, scheduler unit 3804 receives tasks from work distributionunit and manages instruction scheduling for one or more thread blocksassigned to SM 3800. In at least one embodiment, scheduler unit 3804schedules thread blocks for execution as warps of parallel threads,wherein each thread block is allocated at least one warp. In at leastone embodiment, each warp executes threads. In at least one embodiment,scheduler unit 3804 manages a plurality of different thread blocks,allocating warps to different thread blocks and then dispatchinginstructions from plurality of different cooperative groups to variousfunctional units (e.g., processing cores 3810, SFUs 3812, and LSUs 3814)during each clock cycle.

In at least one embodiment, Cooperative Groups may refer to aprogramming model for organizing groups of communicating threads thatallows developers to express granularity at which threads arecommunicating, enabling expression of richer, more efficient paralleldecompositions. In at least one embodiment, cooperative launch APIssupport synchronization amongst thread blocks for execution of parallelalgorithms. In at least one embodiment, applications of conventionalprogramming models provide a single, simple construct for synchronizingcooperating threads: a barrier across all threads of a thread block(e.g., syncthreads( ) function). However, in at least one embodiment,programmers may define groups of threads at smaller than thread blockgranularities and synchronize within defined groups to enable greaterperformance, design flexibility, and software reuse in form ofcollective group-wide function interfaces. In at least one embodiment,Cooperative Groups enables programmers to define groups of threadsexplicitly at sub-block (i.e., as small as a single thread) andmulti-block granularities, and to perform collective operations such assynchronization on threads in a cooperative group. Programming modelsupports clean composition across software boundaries, so that librariesand utility functions can synchronize safely within their local contextwithout having to make assumptions about convergence. In at least oneembodiment, Cooperative Groups primitives enable new patterns ofcooperative parallelism, including, without limitation,producer-consumer parallelism, opportunistic parallelism, and globalsynchronization across an entire grid of thread blocks.

In at least one embodiment, a dispatch unit 3806 is configured totransmit instructions to one or more of functional units and schedulerunit 3804 includes, without limitation, two dispatch units 3806 thatenable two different instructions from same warp to be dispatched duringeach clock cycle. In at least one embodiment, each scheduler unit 3804includes a single dispatch unit 3806 or a38itional dispatch units 3806.

In at least one embodiment, each SM 3800, in at least one embodiment,includes, without limitation, register file 3808 that provides a set ofregisters for functional units of SM 3800. In at least one embodiment,register file 3808 is divided between each of functional units such thateach functional unit is allocated a dedicated portion of register file3808. In at least one embodiment, register file 3808 is divided betweendifferent warps being executed by SM 3800 and register file 3808provides temporary storage for operands connected to data paths offunctional units. In at least one embodiment, each SM 3800 comprises,without limitation, a plurality of L processing cores 3810. In at leastone embodiment, SM 3800 includes, without limitation, a large number(e.g., 128 or more) of distinct processing cores 3810. In at least oneembodiment, each processing core 3810, in at least one embodiment,includes, without limitation, a fully-pipelined, single-precision,double-precision, and/or mixed precision processing unit that includes,without limitation, a floating point arithmetic logic unit and aninteger arithmetic logic unit. In at least one embodiment, floatingpoint arithmetic logic units implement IEEE 754-2008 standard forfloating point arithmetic. In at least one embodiment, processing cores3810 include, without limitation, 64 single-precision (32-bit) floatingpoint cores, 64 integer cores, 32 double-precision (64-bit) floatingpoint cores, and 8 tensor cores.

Tensor cores are configured to perform matrix operations in accordancewith at least one embodiment. In at least one embodiment, one or moretensor cores are included in processing cores 3810. In at least oneembodiment, tensor cores are configured to perform deep learning matrixarithmetic, such as convolution operations for neural network trainingand inferencing. In at least one embodiment, each tensor core operateson a 4×4 matrix and performs a matrix multiply and accumulate operationD=A×B+C, where A, B, C, and D are 4×4 matrices.

In at least one embodiment, matrix multiply inputs A and B are 16-bitfloating point matrices and accumulation matrices C and D are 16-bitfloating point or 32-bit floating point matrices. In at least oneembodiment, tensor cores operate on 16-bit floating point input datawith 32-bit floating point accumulation. In at least one embodiment,16-bit floating point multiply uses 64 operations and results in a fullprecision product that is then accumulated using 32-bit floating pointa38ition with other intermediate products for a 4×4×4 matrix multiply.Tensor cores are used to perform much larger two-dimensional or higherdimensional matrix operations, built up from these smaller elements, inat least one embodiment. In at least one embodiment, an API, such asCUDA 9 C++ API, exposes specialized matrix load, matrix multiply andaccumulate, and matrix store operations to efficiently use tensor coresfrom a CUDA-C++ program. In at least one embodiment, at CUDA level,warp-level interface assumes 16×16 size matrices spanning all 32 threadsof warp.

In at least one embodiment, each SM 3800 comprises, without limitation,M SFUs 3812 that perform special functions (e.g., attribute evaluation,reciprocal square root, and like). In at least one embodiment, SFUs 3812include, without limitation, a tree traversal unit configured totraverse a hierarchical tree data structure. In at least one embodiment,SFUs 3812 include, without limitation, a texture unit configured toperform texture map filtering operations. In at least one embodiment,texture units are configured to load texture maps (e.g., a 2D array oftexels) from memory and sample texture maps to produce sampled texturevalues for use in shader programs executed by SM 3800. In at least oneembodiment, texture maps are stored in shared memory/L1 cache 3818. Inat least one embodiment, texture units implement texture operations suchas filtering operations using mip-maps (e.g., texture maps of varyinglevels of detail), in accordance with at least one embodiment. In atleast one embodiment, each SM 3800 includes, without limitation, twotexture units.

Each SM 3800 comprises, without limitation, N LSUs 3814 that implementload and store operations between shared memory/L1 cache 3818 andregister file 3808, in at least one embodiment. Each SM 3800 includes,without limitation, interconnect network 3816 that connects each offunctional units to register file 3808 and LSU 3814 to register file3808 and shared memory/L1 cache 3818 in at least one embodiment. In atleast one embodiment, interconnect network 3816 is a crossbar that canbe configured to connect any of functional units to any of registers inregister file 3808 and connect LSUs 3814 to register file 3808 andmemory locations in shared memory/L1 cache 3818.

In at least one embodiment, shared memory/L1 cache 3818 is an array ofon-chip memory that allows for data storage and communication between SM3800 and primitive engine and between threads in SM 3800, in at leastone embodiment. In at least one embodiment, shared memory/L1 cache 3818comprises, without limitation, 128 KB of storage capacity and is in pathfrom SM 3800 to partition unit. In at least one embodiment, sharedmemory/L1 cache 3818, in at least one embodiment, is used to cache readsand writes. In at least one embodiment, one or more of shared memory/L1cache 3818, L2 cache, and memory are backing stores.

Combining data cache and shared memory functionality into a singlememory block provides improved performance for both types of memoryaccesses, in at least one embodiment. In at least one embodiment,capacity is used or is usable as a cache by programs that do not useshared memory, such as if shared memory is configured to use half ofcapacity, texture and load/store operations can use remaining capacity.Integration within shared memory/L1 cache 3818 enables shared memory/L1cache 3818 to function as a high-throughput conduit for streaming datawhile simultaneously providing high-bandwidth and low-latency access tofrequently reused data, in accordance with at least one embodiment. Inat least one embodiment, when configured for general purpose parallelcomputation, a simpler configuration can be used compared with graphicsprocessing. In at least one embodiment, fixed function graphicsprocessing units are bypassed, creating a much simpler programmingmodel. In general purpose parallel computation configuration, workdistribution unit assigns and distributes blocks of threads directly toDPCs, in at least one embodiment. In at least one embodiment, threads ina block execute same program, using a unique thread ID in calculation toensure each thread generates unique results, using SM 3800 to executeprogram and perform calculations, shared memory/L1 cache 3818 tocommunicate between threads, and LSU 3814 to read and write globalmemory through shared memory/L1 cache 3818 and memory partition unit. Inat least one embodiment, when configured for general purpose parallelcomputation, SM 3800 writes commands that scheduler unit 3804 can use tolaunch new work on DPCs.

In at least one embodiment, PPU is included in or coupled to a desktopcomputer, a laptop computer, a tablet computer, servers, supercomputers,a smart-phone (e.g., a wireless, hand-held device), personal digitalassistant (“PDA”), a digital camera, a vehicle, a head mounted display,a hand-held electronic device, and more. In at least one embodiment, PPUis embodied on a single semiconductor substrate. In at least oneembodiment, PPU is included in a system-on-a-chip (“SoC”) along with oneor more other devices such as additional PPUs, memory, a reducedinstruction set computer (“RISC”) CPU, a memory management unit (“MMU”),a digital-to-analog converter (“DAC”), and like.

In at least one embodiment, PPU may be included on a graphics card thatincludes one or more memory devices. Graphics card may be configured tointerface with a PCIe slot on a motherboard of a desktop computer. In atleast one embodiment, PPU may be an integrated graphics processing unit(“iGPU”) included in chipset of motherboard.

Inference and/or training logic 1015 are used to perform inferencingand/or training operations associated with one or more embodiments.Details regarding inference and/or training logic 1015 are providedherein in conjunction with FIGS. 10A and/or 10B. In at least oneembodiment, deep learning application processor is used to train amachine learning model, such as a neural network, to predict or inferinformation provided to SM 3800. In at least one embodiment, SM 3800 isused to infer or predict information based on a trained machine learningmodel (e.g., neural network) that has been trained by another processoror system or by SM 3800. In at least one embodiment, SM 3800 may be usedto perform one or more neural network use cases described herein.

In at least one embodiment, a single semiconductor platform may refer toa sole unitary semiconductor-based integrated circuit or chip. In atleast one embodiment, multi-chip modules may be used with increasedconnectivity which simulate on-chip operation, and make substantialimprovements over utilizing a conventional central processing unit(“CPU”) and bus implementation. In at least one embodiment, variousmodules may also be situated separately or in various combinations ofsemiconductor platforms per desires of user.

In at least one embodiment, computer programs in form ofmachine-readable executable code or computer control logic algorithmsare stored in main memory 1604 and/or secondary storage. Computerprograms, if executed by one or more processors, enable system 1600 toperform various functions in accordance with at least one embodiment.Memory 1604, storage, and/or any other storage are possible examples ofcomputer-readable media. In at least one embodiment, secondary storagemay refer to any suitable storage device or system such as a hard diskdrive and/or a removable storage drive, representing a floppy diskdrive, a magnetic tape drive, a compact disk drive, digital versatiledisk (“DVD”) drive, recording device, universal serial bus (“USB”) flashmemory, etc. In at least one embodiment, architecture and/orfunctionality of various previous figures are implemented in context ofCPU 1602; parallel processing system 1612; an integrated circuit capableof at least a portion of capabilities of both CPU 1602; parallelprocessing system 1612; a chipset (e.g., a group of integrated circuitsdesigned to work and sold as a unit for performing related functions,etc.); and any suitable combination of integrated circuit(s).

In at least one embodiment, architecture and/or functionality of variousprevious figures are implemented in context of a general computersystem, a circuit board system, a game console system dedicated forentertainment purposes, an application-specific system, and more. In atleast one embodiment, computer system 1600 may take form of a desktopcomputer, a laptop computer, a tablet computer, servers, supercomputers,a smart-phone (e.g., a wireless, hand-held device), personal digitalassistant (“PDA”), a digital camera, a vehicle, a head mounted display,a hand-held electronic device, a mobile phone device, a television,workstation, game consoles, embedded system, and/or any other type oflogic.

In at least one embodiment, parallel processing system 1612 includes,without limitation, a plurality of parallel processing units (“PPUs”)1614 and associated memories 1616. In at least one embodiment, PPUs 1614are connected to a host processor or other peripheral devices via aninterconnect 1618 and a switch 1620 or multiplexer. In at least oneembodiment, parallel processing system 1612 distributes computationaltasks across PPUs 1614 which can be parallelizable—for example, as partof distribution of computational tasks across multiple graphicsprocessing unit (“GPU”) thread blocks. In at least one embodiment,memory is shared and accessible (e.g., for read and/or write access)across some or all of PPUs 1614, although such shared memory may incurperformance penalties relative to use of local memory and registersresident to a PPU 1614. In at least one embodiment, operation of PPUs1614 is synchronized through use of a command such as _syncthreads( )wherein all threads in a block (e.g., executed across multiple PPUs1614) to reach a certain point of execution of code before proc16ding.

Other variations are within spirit of present disclosure. Thus, whiledisclosed techniques are susceptible to various modifications andalternative constructions, certain illustrated embodiments thereof areshown in drawings and have been described above in detail. It should beunderstood, however, that there is no intention to limit disclosure tospecific form or forms disclosed, but on contrary, intention is to coverall modifications, alternative constructions, and equivalents fallingwithin spirit and scope of disclosure, as defined in appended claims.

Use of terms “a” and “an” and “the” and similar referents in context ofdescribing disclosed embodiments (especially in context of followingclaims) are to be construed to cover both singular and plural, unlessotherwise indicated herein or clearly contradicted by context, and notas a definition of a term. Terms “comprising,” “having,” “including,”and “containing” are to be construed as open-ended terms (meaning“including, but not limited to,”) unless otherwise noted. term“connected,” when unmodified and referring to physical connections, isto be construed as partly or wholly contained within, attached to, orjoined together, even if there is something intervening. Recitation ofranges of values herein are merely intended to serve as a shorthandmethod of referring individually to each separate value falling withinrange, unless otherwise indicated herein and each separate value isincorporated into specification as if it were individually recitedherein. Use of term “set” (e.g., “a set of items”) or “subset” unlessotherwise noted or contradicted by context, is to be construed as anonempty collection comprising one or more members. Further, unlessotherwise noted or contradicted by context, term “subset” of acorresponding set does not necessarily denote a proper subset ofcorresponding set, but subset and corresponding set may be equal.

Conjunctive language, such as phrases of form “at least one of A, B, andC,” or “at least one of A, B and C,” unless specifically statedotherwise or otherwise clearly contradicted by context, is otherwiseunderstood with context as used in general to present that an item,term, etc., may be either A or B or C, or any nonempty subset of set ofA and B and C. For instance, in illustrative example of a set havingthree members, conjunctive phrases “at least one of A, B, and C” and “atleast one of A, B and C” refer to any of following sets: {A}, {B}, {C},{A, B}, {A, C}, {B, C}, {A, B, C}. Thus, such conjunctive language isnot generally intended to imply that certain embodiments require atleast one of A, at least one of B and at least one of C each to bepresent. In addition, unless otherwise noted or contradicted by context,term “plurality” indicates a state of being plural (e.g., “a pluralityof items” indicates multiple items). Number of items in a plurality isat least two but can be more when so indicated either explicitly or bycontext. Further, unless stated otherwise or otherwise clear fromcontext, phrase “based on” means “based at least in part on” and not“based solely on.”

Operations of processes described herein can be performed in anysuitable order unless otherwise indicated herein or otherwise clearlycontradicted by context. In at least one embodiment, a process such asthose processes described herein (or variations and/or combinationsthereof) is performed under control of one or more computer systemsconfigured with executable instructions and is implemented as code(e.g., executable instructions, one or more computer programs or one ormore applications) executing collectively on one or more processors, byhardware or combinations thereof. In at least one embodiment, code isstored on a computer-readable storage medium, for example, in form of acomputer program comprising a plurality of instructions executable byone or more processors. In at least one embodiment, a computer-readablestorage medium is a non-transitory computer-readable storage medium thatexcludes transitory signals (e.g., a propagating transient electric orelectromagnetic transmission) but includes non-transitory data storagecircuitry (e.g., buffers, cache, and queues) within transceivers oftransitory signals. In at least one embodiment, code (e.g., executablecode or source code) is stored on a set of one or more non-transitorycomputer-readable storage media having stored thereon executableinstructions (or other memory to store executable instructions) that,when executed (i.e., as a result of being executed) by one or moreprocessors of a computer system, cause computer system to performoperations described herein. Set of non-transitory computer-readablestorage media, in at least one embodiment, comprises multiplenon-transitory computer-readable storage media and one or more ofindividual non-transitory storage media of multiple non-transitorycomputer-readable storage media lack all of code while multiplenon-transitory computer-readable storage media collectively store all ofcode. In at least one embodiment, executable instructions are executedsuch that different instructions are executed by differentprocessors—for example, a non-transitory computer-readable storagemedium store instructions and a main central processing unit (“CPU”)executes some of instructions while a graphics processing unit (“GPU”)executes other instructions. In at least one embodiment, differentcomponents of a computer system have separate processors and differentprocessors execute different subsets of instructions.

Accordingly, in at least one embodiment, computer systems are configuredto implement one or more services that singly or collectively performoperations of processes described herein and such computer systems areconfigured with applicable hardware and/or software that enableperformance of operations. Further, a computer system that implements atleast one embodiment of present disclosure is a single device and, inanother embodiment, is a distributed computer system comprising multipledevices that operate differently such that distributed computer systemperforms operations described herein and such that a single device doesnot perform all operations.

Use of any and all examples, or exemplary language (e.g., “such as”)provided herein, is intended merely to better illuminate embodiments ofdisclosure and does not pose a limitation on scope of disclosure unlessotherwise claimed. No language in specification should be construed asindicating any non-claimed element as essential to practice ofdisclosure.

All references, including publications, patent applications, andpatents, cited herein are hereby incorporated by reference to sameextent as if each reference were individually and specifically indicatedto be incorporated by reference and were set forth in its entiretyherein.

In description and claims, terms “coupled” and “connected,” along withtheir derivatives, may be used. It should be understood that these termsmay be not intended as synonyms for each other. Rather, in particularexamples, “connected” or “coupled” may be used to indicate that two ormore elements are in direct or indirect physical or electrical contactwith each other. “Coupled” may also mean that two or more elements arenot in direct contact with each other, but yet still co-operate orinteract with each other.

Unless specifically stated otherwise, it may be appreciated thatthroughout specification terms such as “processing,” “computing,”“calculating,” “determining,” or like, refer to action and/or processesof a computer or computing system, or similar electronic computingdevice, that manipulate and/or transform data represented as physical,such as electronic, quantities within computing system's registersand/or memories into other data similarly represented as physicalquantities within computing system's memories, registers or other suchinformation storage, transmission or display devices.

In a similar manner, term “processor” may refer to any device or portionof a device that processes electronic data from registers and/or memoryand transform that electronic data into other electronic data that maybe stored in registers and/or memory. As non-limiting examples,“processor” may be a CPU or a GPU. A “computing platform” may compriseone or more processors. As used herein, “software” processes mayinclude, for example, software and/or hardware entities that performwork over time, such as tasks, threads, and intelligent agents. Also,each process may refer to multiple processes, for carrying outinstructions in sequence or in parallel, continuously or intermittently.Terms “system” and “method” are used herein interchangeably insofar assystem may embody one or more methods and methods may be considered asystem.

In present document, references may be made to obtaining, acquiring,receiving, or inputting analog or digital data into a subsystem,computer system, or computer-implemented machine. Process of obtaining,acquiring, receiving, or inputting analog and digital data can beaccomplished in a variety of ways such as by receiving data as aparameter of a function call or a call to an application programminginterface. In some implementations, process of obtaining, acquiring,receiving, or inputting analog or digital data can be accomplished bytransferring data via a serial or parallel interface. In anotherimplementation, process of obtaining, acquiring, receiving, or inputtinganalog or digital data can be accomplished by transferring data via acomputer network from providing entity to acquiring entity. Referencesmay also be made to providing, outputting, transmitting, sending, orpresenting analog or digital data. In various examples, process ofproviding, outputting, transmitting, sending, or presenting analog ordigital data can be accomplished by transferring data as an input oroutput parameter of a function call, a parameter of an applicationprogramming interface or interprocess communication mechanism.

Although discussion above sets forth example implementations ofdescribed techniques, other architectures may be used to implementdescribed functionality, and are intended to be within scope of thisdisclosure. Furthermore, although specific distributions ofresponsibilities are defined above for purposes of discussion, variousfunctions and responsibilities might be distributed and divided indifferent ways, depending on circumstances.

Furthermore, although subject matter has been described in languagespecific to structural features and/or methodological acts, it is to beunderstood that subject matter claimed in appended claims is notnecessarily limited to specific features or acts described. Rather,specific features and acts are disclosed as exemplary forms ofimplementing claims.

What is claimed is:
 1. A processor comprising: one or more arithmeticlogic units (ALUs) to perform a spatial query relative to a location byat least calculating regions around potential results to the query andtracing a ray from the location to determine intersections with thecalculated regions, wherein the intersections indicate whethercorresponding potential results satisfy the query.
 2. The processor ofclaim 1, wherein the regions are produced by generating, for eachpotential result of the potential results, an object centered on arespective potential result, the object having a shape that matches asearch space.
 3. The processor of claim 1, wherein: results of thespatial query are determined based on the intersections; and a potentialresult is determined to be in a search space based at least in part ondetection of an exit of the ray from a region associated with thepotential result.
 4. The processor of claim 1, wherein: the ray isprojected from the location; and the ray is projected a distance of atleast a greatest dimension of a search space.
 5. The processor of claim1, wherein: the spatial query identifies data points within a searchspace; the search space is a first rectangle centered on the location;and each result in the potential results is a second rectangle thatmatches the first rectangle in size centered around an associatedpotential result.
 6. The processor of claim 1, wherein the spatial queryidentifies a set of data points within a point-symmetric search spacecentered on the location.
 7. The processor of claim 1, wherein: the rayis projected from the location produces a set of entry intersections anda set of exit intersections for an object associated with a data point;and the data point is determined to be within the search space as aresult of a number of exit intersections being greater than a number ofentry intersections.
 8. The processor of claim 1, wherein: the spatialquery identifies data points within a search space; the search space issymmetric around the location; and each region matches a shape of thesearch space.
 9. The processor of claim 1, wherein each region iscentered on a potential result.
 10. The processor of claim 1, wherein:the processor is a graphical processing unit that includes a ray tracingsubsystem; and the ray tracing subsystem is used to trace the ray.
 11. Asystem, comprising one or more processors and memory to store executableinstructions that, as a result of being executed by the one or moreprocessors, cause the system to identify data points within a searchregion by at least projecting a ray from a point of interest within thesearch region to produce a set of intersections with objects thatrepresent spatial data points.
 12. The system of claim 11, wherein: atleast one of the objects represents a respective spatial data point ofthe spatial data points; the at least one of the objects is centered onthe respective spatial data point; and the at least one of the objectshas a shape that matches a shape of the search region.
 13. The system ofclaim 11, wherein the data points within the search region aredetermined based on a number of intersections in the set ofintersections for each of the objects.
 14. The system of claim 13,wherein a data point is determined to be in the search region based atleast in part on detection of an exit of the ray from an objectassociated with the data point.
 15. The system of claim 11, wherein theray is projected to a distance limited by the extent of the searchregion.
 16. The system of claim 11, wherein: the search region is afirst box centered on the point of interest; and each of the objects isa respective second box that matches the first box in size centeredaround an associated data point.
 17. The system of claim 11, wherein:the search region is point-symmetric; and the point of interest is apoint of symmetry for the search region.
 18. The system of claim 11,wherein: the system is part of an autonomous vehicle; and the point ofinterest is a location of the autonomous vehicle.
 19. A methodcomprising: generating a point-symmetric object centered on a spatialdata point; and determining that the spatial data point is within asearch area by at least determining that a ray projected from a point ofinterest exits the point-symmetric object.
 20. The method of claim 19,wherein: the point-symmetric object is centered on a respective datapoint; and the point-symmetric object has a shape that matches a shapeof the search area.
 21. The method of claim 19, wherein the spatial datapoint is determined to be in the search area as a result of the rayhaving a number of exit intersections that is greater than a number ofentry intersections.
 22. The method of claim 19, wherein the search areais defined in a space of two, three or higher dimensions.
 23. The methodof claim 19, wherein the search area has a point of symmetry such thatevery point on the surface of the search area has a matching pointequidistant from the point of symmetry but in the opposite direction.24. The method of claim 19, wherein the ray and the object are modeledby a graphic processing unit that performs a ray-tracing operation todetermine an intersection between the point-symmetric object and theray.
 25. The method of claim 19, wherein: the search area exhibitscentral symmetry around the point of interest; and the object has ashape that matches the search area.
 26. The method of claim 19, whereina point of symmetry of the point-symmetric object is located at thespatial data point.
 27. The method of claim 19, wherein: the spatialdata point is a point of interest in a navigation database; and thesearch area is defined by a distance from a vehicle.
 28. The method ofclaim 19, comprising: obtaining a request to locate a point of interestwithin a threshold distance of a location; generating thepoint-symmetric object based at least in part on the point of interest;and indicating, to a requester, that the point of interest within thethreshold distance based at least in part on the ray exiting thepoint-symmetric object.